| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
An exact algorithm for the network pricing problem
|
Brotcorne, L.
|
|
2011
|
8 |
2 |
p. 246-258
13 p.
|
artikel
|
| 2 |
An exact approach for the Vertex Coloring Problem
|
Malaguti, Enrico
|
|
2011
|
8 |
2 |
p. 174-190
17 p.
|
artikel
|
| 3 |
A Note on “Lot-sizing with fixed charges on stocks: The convex hull”
|
Gade, Dinakar
|
|
2011
|
8 |
2 |
p. 385-392
8 p.
|
artikel
|
| 4 |
A polyhedral study on 0 – 1 knapsack problems with disjoint cardinality constraints: Facet-defining inequalities by sequential lifting
|
Zeng, Bo
|
|
2011
|
8 |
2 |
p. 277-301
25 p.
|
artikel
|
| 5 |
A polyhedral study on 0–1 knapsack problems with disjoint cardinality constraints: Strong valid inequalities by sequence-independent lifting
|
Zeng, Bo
|
|
2011
|
8 |
2 |
p. 259-276
18 p.
|
artikel
|
| 6 |
Cutting stock with no three parts per pattern: Work-in-process and pattern minimization
|
Aloisio, Alessandro
|
|
2011
|
8 |
2 |
p. 315-332
18 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
2011
|
8 |
2 |
p. IFC-
1 p.
|
artikel
|
| 8 |
Generalized resolution search
|
Posta, Marius
|
|
2011
|
8 |
2 |
p. 215-228
14 p.
|
artikel
|
| 9 |
Information-theoretic approaches to branching in search
|
Gilpin, Andrew
|
|
2011
|
8 |
2 |
p. 147-159
13 p.
|
artikel
|
| 10 |
On coloring the arcs of a tournament, covering shortest paths, and reducing the diameter of a graph
|
Guttmann-Beck, Nili
|
|
2011
|
8 |
2 |
p. 302-314
13 p.
|
artikel
|
| 11 |
Online variable-sized bin packing with conflicts
|
Epstein, Leah
|
|
2011
|
8 |
2 |
p. 333-343
11 p.
|
artikel
|
| 12 |
On the linear relaxation of the p -median problem
|
Baïou, Mourad
|
|
2011
|
8 |
2 |
p. 344-375
32 p.
|
artikel
|
| 13 |
Quantum annealing of the graph coloring problem
|
Titiloye, Olawale
|
|
2011
|
8 |
2 |
p. 376-384
9 p.
|
artikel
|
| 14 |
Strengthening lattice-free cuts using non-negativity
|
Fukasawa, Ricardo
|
|
2011
|
8 |
2 |
p. 229-245
17 p.
|
artikel
|
| 15 |
The minimum spanning tree problem with conflict constraints and its variations
|
Zhang, Ruonan
|
|
2011
|
8 |
2 |
p. 191-205
15 p.
|
artikel
|
| 16 |
Upgrading edge-disjoint paths in a ring
|
Szabó, Jácint
|
|
2011
|
8 |
2 |
p. 206-214
9 p.
|
artikel
|
| 17 |
Using Markov chains to analyze the effectiveness of local search algorithms
|
Nikolaev, Alexander G.
|
|
2011
|
8 |
2 |
p. 160-173
14 p.
|
artikel
|
Tijdschrift beschrijving