nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A Branch&Price&Cut algorithm for the Vehicle Routing Problem with Intermediate Replenishment Facilities
|
Gianessi, Paolo |
|
2016 |
55 |
C |
p. 93-96 4 p. |
artikel |
2 |
A generalized Gilmore-Lawler procedure for the Quadratic Assignment Problem
|
Rostami, Borzou |
|
2016 |
55 |
C |
p. 77-80 4 p. |
artikel |
3 |
Algorithms for uniform centered partitions of trees
|
Lari, Isabella |
|
2016 |
55 |
C |
p. 37-40 4 p. |
artikel |
4 |
A lower bound for the sum of the two largest signless Laplacian eigenvalues
|
Oliveira, Carla Silva |
|
2016 |
55 |
C |
p. 173-176 4 p. |
artikel |
5 |
A new Mathematical Programming Model for the Green Vehicle Routing Problem
|
Bruglieri, Maurizio |
|
2016 |
55 |
C |
p. 89-92 4 p. |
artikel |
6 |
A Note on Fractional Coloring and the Integrality gap of LP for Maximum Weight Independent Set
|
Chalermsook, Parinya |
|
2016 |
55 |
C |
p. 113-116 4 p. |
artikel |
7 |
A Polynomial Recognition of Unit Forms
|
Alves, Jesmmer |
|
2016 |
55 |
C |
p. 203-206 4 p. |
artikel |
8 |
A preliminary analysis of the Distance Based Critical Node Problem
|
Aringhieri, Roberto |
|
2016 |
55 |
C |
p. 25-28 4 p. |
artikel |
9 |
Column generation for the variable cost and size bin packing problem with fragmentation
|
Casazza, Marco |
|
2016 |
55 |
C |
p. 61-64 4 p. |
artikel |
10 |
Combinatorial Relaxation Bounds and Preprocessing for Berth Allocation Problems
|
Cavalcante, Evellyn |
|
2016 |
55 |
C |
p. 85-88 4 p. |
artikel |
11 |
Determining the Optimal Strategies for Zero-Sum Average Stochastic Positional Games
|
Lozovanu, Dmitrii |
|
2016 |
55 |
C |
p. 155-159 5 p. |
artikel |
12 |
Diameter, minimum degree and hyperbolicity constant in graphs
|
Hernández, Verónica |
|
2016 |
55 |
C |
p. 181-184 4 p. |
artikel |
13 |
Dimension and codimension of simple games
|
Kurz, Sascha |
|
2016 |
55 |
C |
p. 147-150 4 p. |
artikel |
14 |
Drezner's Exact Method for the Continuous p-Centre Problem Revisited
|
Callaghan, Becky |
|
2016 |
55 |
C |
p. 41-44 4 p. |
artikel |
15 |
Dual approaches for a specific class of integer nonlinear programming problems
|
De Santis, Marianna |
|
2016 |
55 |
C |
p. 73-76 4 p. |
artikel |
16 |
Encoding Bigraphical Reactive Systems into Graph Transformation Systems
|
Gassara, Amal |
|
2016 |
55 |
C |
p. 207-210 4 p. |
artikel |
17 |
Equivalent Nonlinear Complementarity Problem for Chance-constrained Games
|
Singh, Vikas Vikram |
|
2016 |
55 |
C |
p. 151-154 4 p. |
artikel |
18 |
Experiments with two heuristic algorithms for the Maximum Algebraic Connectivity Augmentation Problem
|
Justel, Claudia |
|
2016 |
55 |
C |
p. 13-16 4 p. |
artikel |
19 |
Graphs with large girth are b-continuous
|
Silva, Ana |
|
2016 |
55 |
C |
p. 101-104 4 p. |
artikel |
20 |
Hardness results for stable exchange problems
|
Mészáros-Karkus, Zsuzsa |
|
2016 |
55 |
C |
p. 165-168 4 p. |
artikel |
21 |
Heuristics for static cloudlet location
|
Ceselli, Alberto |
|
2016 |
55 |
C |
p. 21-24 4 p. |
artikel |
22 |
Heuristics for the General Multiple Non-linear Knapsack Problem
|
Mencarelli, Luca |
|
2016 |
55 |
C |
p. 69-72 4 p. |
artikel |
23 |
Intersection of Longest Paths in Graph Classes
|
Cerioli, Márcia R. |
|
2016 |
55 |
C |
p. 139-142 4 p. |
artikel |
24 |
Linear Models and Computational Experiments for the Quadratic TSP
|
Fischer, Anja |
|
2016 |
55 |
C |
p. 97-100 4 p. |
artikel |
25 |
List Coloring of Planar Graphs with Forbidden Cycles
|
Gorla, Sreekanth |
|
2016 |
55 |
C |
p. 117-121 5 p. |
artikel |
26 |
Maximin Fairness in Project Budget Allocation
|
Naldi, Maurizio |
|
2016 |
55 |
C |
p. 65-68 4 p. |
artikel |
27 |
Multimode extensions of Combinatorial Optimization problems
|
Cordone, Roberto |
|
2016 |
55 |
C |
p. 17-20 4 p. |
artikel |
28 |
New methods for the Distance Geometry Problem
|
Dias, Gustavo |
|
2016 |
55 |
C |
p. 45-48 4 p. |
artikel |
29 |
On Longest Cycles in Essentially 4-connected Planar Graphs
|
Harant, Jochen |
|
2016 |
55 |
C |
p. 143-146 4 p. |
artikel |
30 |
On Minimum Average Stretch Spanning Trees in Grid Graphs
|
Pundir, Pankaj |
|
2016 |
55 |
C |
p. 131-134 4 p. |
artikel |
31 |
On the chromatic number of (P 5, K 2,t )-free graphs
|
Brause, Christoph |
|
2016 |
55 |
C |
p. 127-130 4 p. |
artikel |
32 |
On the Complexity of the P 3-Hull Number of the Cartesian Product of Graphs
|
Nascimento, Julliano R. |
|
2016 |
55 |
C |
p. 169-172 4 p. |
artikel |
33 |
On the minimum degree and the proper connection number of graphs
|
Brause, Christoph |
|
2016 |
55 |
C |
p. 109-112 4 p. |
artikel |
34 |
On the shelling antimatroids of split graphs
|
Merckx, Keno |
|
2016 |
55 |
C |
p. 199-202 4 p. |
artikel |
35 |
On Three Extensions of Equimatchable Graphs
|
Deniz, Zakir |
|
2016 |
55 |
C |
p. 177-180 4 p. |
artikel |
36 |
Partitioning a graph into minimum gap components
|
Bruglieri, Maurizio |
|
2016 |
55 |
C |
p. 33-36 4 p. |
artikel |
37 |
Preface
|
Ceselli, Alberto |
|
2016 |
55 |
C |
p. 1-3 3 p. |
artikel |
38 |
Proper connection number 2, connectivity, and forbidden subgraphs
|
Brause, Christoph |
|
2016 |
55 |
C |
p. 105-108 4 p. |
artikel |
39 |
Scheduling parallel jobs on heterogeneous platforms
|
Jansen, Klaus |
|
2016 |
55 |
C |
p. 9-12 4 p. |
artikel |
40 |
Solving LP using random projections
|
Liberti, Leo |
|
2016 |
55 |
C |
p. 53-56 4 p. |
artikel |
41 |
Squares of Low Clique Number
|
Golovach, Petr |
|
2016 |
55 |
C |
p. 195-198 4 p. |
artikel |
42 |
Stochastic geometric programming with joint probabilistic constraints
|
Liu, Jia |
|
2016 |
55 |
C |
p. 49-52 4 p. |
artikel |
43 |
Subset matching and edge coloring in bipartite graphs
|
Yavuzyılmaz, Ömer Can |
|
2016 |
55 |
C |
p. 123-126 4 p. |
artikel |
44 |
The Capacitated Budgeted Minimum Cost Flow Problem with Unit Upgrading Costs
|
Büsing, Christina |
|
2016 |
55 |
C |
p. 135-138 4 p. |
artikel |
45 |
The Complexity of SIMPLE MAX-CUT on Comparability Graphs
|
Veiga Pocai, Rafael |
|
2016 |
55 |
C |
p. 161-164 4 p. |
artikel |
46 |
The Linear Extension Polytope of a Poset
|
Doignon, Jean-Paul |
|
2016 |
55 |
C |
p. 81-84 4 p. |
artikel |
47 |
The Prize-collecting Scheduling Problem with Deadlines
|
Hosteins, Pierre |
|
2016 |
55 |
C |
p. 57-60 4 p. |
artikel |
48 |
The Shared Broadcast Tree Problem and MST
|
Ivanova, Marika |
|
2016 |
55 |
C |
p. 5-8 4 p. |
artikel |
49 |
Timetable Optimization for High-Speed Trains at Chinese Railways
|
Cacchiani, Valentina |
|
2016 |
55 |
C |
p. 29-32 4 p. |
artikel |
50 |
Vertices, edges, distances and metric dimension in graphs
|
Yero, Ismael González |
|
2016 |
55 |
C |
p. 191-194 4 p. |
artikel |
51 |
Weighted Graphs as Dynamical Interaction Systems
|
Faigle, Ulrich |
|
2016 |
55 |
C |
p. 185-189 5 p. |
artikel |