| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A hybrid algorithm for the unbounded knapsack problem
|
Poirriez, Vincent
|
|
2009
|
6 |
1 |
p. 110-124
15 p.
|
artikel
|
| 2 |
A study of the quadratic semi-assignment polytope
|
Saito, Hiroo
|
|
2009
|
6 |
1 |
p. 37-50
14 p.
|
artikel
|
| 3 |
Cycle-based facets of chromatic scheduling polytopes
|
Marenco, Javier
|
|
2009
|
6 |
1 |
p. 51-63
13 p.
|
artikel
|
| 4 |
Editorial Board
|
|
|
2009
|
6 |
1 |
p. IFC-
1 p.
|
artikel
|
| 5 |
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques
|
Marenco, Javier
|
|
2009
|
6 |
1 |
p. 64-78
15 p.
|
artikel
|
| 6 |
Integral cycle bases for cyclic timetabling
|
Liebchen, Christian
|
|
2009
|
6 |
1 |
p. 98-109
12 p.
|
artikel
|
| 7 |
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs
|
Ishii, Toshimasa
|
|
2009
|
6 |
1 |
p. 23-36
14 p.
|
artikel
|
| 8 |
Minimum mean cycle problem in bidirected and skew-symmetric graphs
|
Babenko, Maxim A.
|
|
2009
|
6 |
1 |
p. 92-97
6 p.
|
artikel
|
| 9 |
Minimum partition of an independence system into independent sets
|
Zhou, Sanming
|
|
2009
|
6 |
1 |
p. 125-133
9 p.
|
artikel
|
| 10 |
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors
|
Kubiak, Wieslaw
|
|
2009
|
6 |
1 |
p. 79-91
13 p.
|
artikel
|
| 11 |
The one-machine just-in-time scheduling problem with preemption
|
Hendel, Yann
|
|
2009
|
6 |
1 |
p. 10-22
13 p.
|
artikel
|
| 12 |
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes
|
Doignon, Jean-Paul
|
|
2009
|
6 |
1 |
p. 1-9
9 p.
|
artikel
|
Tijdschrift beschrijving