| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A branch-and-cut algorithm for the minimum-adjacency vertex coloring problem
|
Delle Donne, Diego
|
|
2011
|
|
4 |
p. 540-554
15 p.
|
artikel
|
| 2 |
A computational comparison of flow formulations for the capacitated location-routing problem
|
Contardo, Claudio
|
|
2013
|
|
4 |
p. 263-295
33 p.
|
artikel
|
| 3 |
A dual ascent procedure for the set partitioning problem
|
Boschetti, M.A.
|
|
2008
|
|
4 |
p. 735-747
13 p.
|
artikel
|
| 4 |
A General VNS heuristic for the traveling salesman problem with time windows
|
da Silva, Rodrigo Ferreira
|
|
2010
|
|
4 |
p. 203-211
9 p.
|
artikel
|
| 5 |
A local search algorithm for binary maximum 2-path partitioning
|
Hassin, Refael
|
|
2013
|
|
4 |
p. 333-360
28 p.
|
artikel
|
| 6 |
An algorithm to increase the node-connectivity of a digraph by one
|
Frank, András
|
|
2008
|
|
4 |
p. 677-684
8 p.
|
artikel
|
| 7 |
An asymptotically optimal online algorithm to minimize the total completion time on two multipurpose machines with unit processing times
|
Shabtay, Dvir
|
|
2012
|
|
4 |
p. 241-248
8 p.
|
artikel
|
| 8 |
A new construction of 3 ̄ -separable matrices via an improved decoding of Macula’s construction
|
Fu, Hung-Lin
|
|
2008
|
|
4 |
p. 700-704
5 p.
|
artikel
|
| 9 |
An iterated local search algorithm based on nonlinear programming for the irregular strip packing problem
|
Imamichi, Takashi
|
|
2009
|
|
4 |
p. 345-361
17 p.
|
artikel
|
| 10 |
A note on a polynomial time solvable case of the quadratic assignment problem
|
Erdoğan, Güneş
|
|
2006
|
|
4 |
p. 382-384
3 p.
|
artikel
|
| 11 |
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
|
Sukegawa, Noriyoshi
|
|
2013
|
|
4 |
p. 331-332
2 p.
|
artikel
|
| 12 |
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
|
Rapine, Christophe
|
|
2013
|
|
4 |
p. 241-250
10 p.
|
artikel
|
| 13 |
A polynomial time algorithm for unloading boxes off a gravity conveyor
|
Baptiste, Pierre
|
|
2013
|
|
4 |
p. 251-262
12 p.
|
artikel
|
| 14 |
A simple algorithm for finding a maximum triangle-free 2 -matching in subcubic graphs
|
Kobayashi, Yusuke
|
|
2010
|
|
4 |
p. 197-202
6 p.
|
artikel
|
| 15 |
Author index to volume 3
|
|
|
2006
|
|
4 |
p. 398-400
3 p.
|
artikel
|
| 16 |
Author index to volume 2
|
|
|
2005
|
|
4 |
p. 409-410
2 p.
|
artikel
|
| 17 |
Balanced home–away assignments
|
Knust, Sigrid
|
|
2006
|
|
4 |
p. 354-365
12 p.
|
artikel
|
| 18 |
Bilevel time minimizing transportation problem
|
Sonia,
|
|
2008
|
|
4 |
p. 714-723
10 p.
|
artikel
|
| 19 |
Chip firing and all-terminal network reliability bounds
|
Brown, Jason I.
|
|
2009
|
|
4 |
p. 436-445
10 p.
|
artikel
|
| 20 |
Clique facets of the axial and planar assignment polytopes
|
Magos, D.
|
|
2009
|
|
4 |
p. 394-413
20 p.
|
artikel
|
| 21 |
Composite lifting of group inequalities and an application to two-row mixing inequalities
|
Dey, Santanu S.
|
|
2010
|
|
4 |
p. 256-268
13 p.
|
artikel
|
| 22 |
Computational complexity of some scheduling problems with multiprocessor tasks
|
Zinder, Yakov
|
|
2005
|
|
4 |
p. 391-408
18 p.
|
artikel
|
| 23 |
Computing and minimizing the relative regret in combinatorial optimization with interval data
|
Averbakh, Igor
|
|
2005
|
|
4 |
p. 273-287
15 p.
|
artikel
|
| 24 |
Computing minimum multiway cuts in hypergraphs
|
Fukunaga, Takuro
|
|
2013
|
|
4 |
p. 371-382
12 p.
|
artikel
|
| 25 |
Cook, Kannan and Schrijver’s example revisited
|
Li, Yanjun
|
|
2008
|
|
4 |
p. 724-734
11 p.
|
artikel
|
| 26 |
Coordination mechanisms with hybrid local policies
|
Lee, Kangbok
|
|
2011
|
|
4 |
p. 513-524
12 p.
|
artikel
|
| 27 |
Courcelle’s theorem—A game-theoretic approach
|
Kneis, Joachim
|
|
2011
|
|
4 |
p. 568-594
27 p.
|
artikel
|
| 28 |
Cutting plane algorithms for solving a stochastic edge-partition problem
|
Taşkın, Z. Caner
|
|
2009
|
|
4 |
p. 420-435
16 p.
|
artikel
|
| 29 |
Cyclical scheduling and multi-shift scheduling: Complexity and approximation algorithms
|
Hochbaum, Dorit S.
|
|
2006
|
|
4 |
p. 327-340
14 p.
|
artikel
|
| 30 |
Editorial Board
|
|
|
2009
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 31 |
Editorial Board
|
|
|
2010
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 32 |
Editorial Board
|
|
|
2006
|
|
4 |
p. v-vi
nvt p.
|
artikel
|
| 33 |
Editorial board
|
|
|
2005
|
|
4 |
p. CO2-
1 p.
|
artikel
|
| 34 |
Editorial Board
|
|
|
2008
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 35 |
Editorial Board
|
|
|
2013
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 36 |
Editorial Board
|
|
|
2011
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 37 |
Editorial Board
|
|
|
2012
|
|
4 |
p. IFC-
1 p.
|
artikel
|
| 38 |
Finding a length-constrained maximum-sum or maximum-density subtree and its application to logistics
|
Lau, Hoong Chuin
|
|
2006
|
|
4 |
p. 385-391
7 p.
|
artikel
|
| 39 |
Finding low cost TSP and 2-matching solutions using certain half-integer subtour vertices
|
Boyd, Sylvia
|
|
2011
|
|
4 |
p. 525-539
15 p.
|
artikel
|
| 40 |
Geometric quadrisection in linear time, with application to VLSI placement
|
Vygen, Jens
|
|
2005
|
|
4 |
p. 362-390
29 p.
|
artikel
|
| 41 |
Graph coloring with cardinality constraints on the neighborhoods
|
Costa, M.-C.
|
|
2009
|
|
4 |
p. 362-369
8 p.
|
artikel
|
| 42 |
Greedy-type resistance of combinatorial problems
|
Bendall, Gareth
|
|
2006
|
|
4 |
p. 288-298
11 p.
|
artikel
|
| 43 |
Hypergraphs and the Clar problem in hexagonal systems
|
Salem, Khaled
|
|
2006
|
|
4 |
p. 392-397
6 p.
|
artikel
|
| 44 |
Improved bounds for vehicle routing solutions
|
Bompadre, Agustín
|
|
2006
|
|
4 |
p. 299-316
18 p.
|
artikel
|
| 45 |
Interleaving two-phased jobs on a single machine
|
Sherali, Hanif D.
|
|
2005
|
|
4 |
p. 348-361
14 p.
|
artikel
|
| 46 |
Linear optimization over permutation groups
|
Buchheim, Christoph
|
|
2005
|
|
4 |
p. 308-319
12 p.
|
artikel
|
| 47 |
Local search intensified: Very large-scale variable neighborhood search for the multi-resource generalized assignment problem
|
Mitrović-Minić, Snežana
|
|
2009
|
|
4 |
p. 370-377
8 p.
|
artikel
|
| 48 |
Minimum number of queries for an adaptive liar search game with small sets
|
Meng, Kun
|
|
2013
|
|
4 |
p. 233-240
8 p.
|
artikel
|
| 49 |
Mixed n -step MIR inequalities: Facets for the n -mixing set
|
Sanjeevi, Sujeevraja
|
|
2012
|
|
4 |
p. 216-235
20 p.
|
artikel
|
| 50 |
More on online bin packing with two item sizes
|
Epstein, Leah
|
|
2008
|
|
4 |
p. 705-713
9 p.
|
artikel
|
| 51 |
Network design with weighted degree constraints
|
Fukunaga, Takuro
|
|
2010
|
|
4 |
p. 246-255
10 p.
|
artikel
|
| 52 |
New algorithms for convex cost tension problem with application to computer vision
|
Kolmogorov, Vladimir
|
|
2009
|
|
4 |
p. 378-393
16 p.
|
artikel
|
| 53 |
Offline and online facility leasing
|
Nagarajan, Chandrashekhar
|
|
2013
|
|
4 |
p. 361-370
10 p.
|
artikel
|
| 54 |
On finitely generated closures in the theory of cutting planes
|
Averkov, Gennadiy
|
|
2012
|
|
4 |
p. 209-215
7 p.
|
artikel
|
| 55 |
On relocation problems with multiple identical working crews
|
Kononov, A.V.
|
|
2006
|
|
4 |
p. 366-381
16 p.
|
artikel
|
| 56 |
On shortest disjoint paths in planar graphs
|
Kobayashi, Yusuke
|
|
2010
|
|
4 |
p. 234-245
12 p.
|
artikel
|
| 57 |
On the computability of equitable divisions
|
Cechlárová, Katarína
|
|
2012
|
|
4 |
p. 249-257
9 p.
|
artikel
|
| 58 |
Orbitopal fixing
|
Kaibel, Volker
|
|
2011
|
|
4 |
p. 595-610
16 p.
|
artikel
|
| 59 |
Packing into the smallest square: Worst-case analysis of lower bounds
|
Caprara, Alberto
|
|
2006
|
|
4 |
p. 317-326
10 p.
|
artikel
|
| 60 |
Parameterized algorithms for weighted matching and packing problems
|
Wang, Jianxin
|
|
2008
|
|
4 |
p. 748-754
7 p.
|
artikel
|
| 61 |
Partial multicovering and the d -consecutive ones property
|
Rawitz, Dror
|
|
2011
|
|
4 |
p. 555-567
13 p.
|
artikel
|
| 62 |
Perfectness of clustered graphs
|
Bonomo, Flavia
|
|
2013
|
|
4 |
p. 296-303
8 p.
|
artikel
|
| 63 |
Pinpointing the complexity of the interval min–max regret knapsack problem
|
Deineko, Vladimir G.
|
|
2010
|
|
4 |
p. 191-196
6 p.
|
artikel
|
| 64 |
Polyhedral results on single node variable upper-bound flow models with allowed configurations
|
Kis, Tamás
|
|
2006
|
|
4 |
p. 341-353
13 p.
|
artikel
|
| 65 |
Preemptive scheduling of equal length jobs with release dates on two uniform parallel machines
|
Lushchakova, Irina N.
|
|
2009
|
|
4 |
p. 446-460
15 p.
|
artikel
|
| 66 |
Recent results on well-balanced orientations
|
Bernáth, Attila
|
|
2008
|
|
4 |
p. 663-676
14 p.
|
artikel
|
| 67 |
Scheduling jobs with time-resource tradeoff via nonlinear programming
|
Grigoriev, Alexander
|
|
2009
|
|
4 |
p. 414-419
6 p.
|
artikel
|
| 68 |
Scheduling on same-speed processors with at most one downtime on each machine
|
Grigoriu, Liliana
|
|
2010
|
|
4 |
p. 212-221
10 p.
|
artikel
|
| 69 |
Searching for realizations of finite metric spaces in tight spans
|
Herrmann, Sven
|
|
2013
|
|
4 |
p. 310-319
10 p.
|
artikel
|
| 70 |
Sensitivity analysis of the optimum to perturbation of the profit of a subset of items in the binary knapsack problem
|
Belgacem, Tarik
|
|
2008
|
|
4 |
p. 755-761
7 p.
|
artikel
|
| 71 |
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study
|
Hifi, Mhand
|
|
2013
|
|
4 |
p. 320-330
11 p.
|
artikel
|
| 72 |
Sparse regular induced subgraphs in 2 P 3 -free graphs
|
Lozin, Vadim V.
|
|
2013
|
|
4 |
p. 304-309
6 p.
|
artikel
|
| 73 |
The Delivery Man Problem with time windows
|
Heilporn, Géraldine
|
|
2010
|
|
4 |
p. 269-282
14 p.
|
artikel
|
| 74 |
The k edge-disjoint 3-hop-constrained paths polytope
|
Bendali, F.
|
|
2010
|
|
4 |
p. 222-233
12 p.
|
artikel
|
| 75 |
The ( K , k ) -capacitated spanning tree problem
|
Arkin, Esther M.
|
|
2012
|
|
4 |
p. 258-266
9 p.
|
artikel
|
| 76 |
The S -digraph optimization problem and the greedy algorithm
|
Hartvigsen, David
|
|
2005
|
|
4 |
p. 320-334
15 p.
|
artikel
|
| 77 |
The submodular knapsack polytope
|
Atamtürk, Alper
|
|
2009
|
|
4 |
p. 333-344
12 p.
|
artikel
|
| 78 |
The time-dependent traveling salesman problem and single machine scheduling problems with sequence dependent setup times
|
Bigras, Louis-Philippe
|
|
2008
|
|
4 |
p. 685-699
15 p.
|
artikel
|
| 79 |
Total domination and the Caccetta–Häggkvist conjecture
|
St-Louis, Patrick
|
|
2012
|
|
4 |
p. 236-240
5 p.
|
artikel
|
| 80 |
Using fractional primal–dual to schedule split intervals with demands
|
Bar-Yehuda, Reuven
|
|
2006
|
|
4 |
p. 275-287
13 p.
|
artikel
|
| 81 |
Using rank-1 lift-and-project closures to generate cuts for 0–1 MIPs, a computational investigation
|
Bonami, P.
|
|
2005
|
|
4 |
p. 288-307
20 p.
|
artikel
|
| 82 |
Wavelength routing of uniform instances in all-optical rings
|
Narayanan, Lata
|
|
2005
|
|
4 |
p. 335-347
13 p.
|
artikel
|
Tijdschrift beschrijving