nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Algorithms for the bounded set-up knapsack problem
|
McLay, Laura A. |
|
2007 |
4 |
2 |
p. 206-212 7 p. |
artikel |
2 |
A model to optimize placement operations on dual-head placement machines
|
Wilhelm, Wilbert E. |
|
2007 |
4 |
2 |
p. 232-256 25 p. |
artikel |
3 |
A polynomial time equivalence between DNA sequencing and the exact perfect matching problem
|
Błażewicz, Jacek |
|
2007 |
4 |
2 |
p. 154-162 9 p. |
artikel |
4 |
Bounds for online bounded space hypercube packing
|
Epstein, Leah |
|
2007 |
4 |
2 |
p. 185-197 13 p. |
artikel |
5 |
Editorial Board
|
|
|
2007 |
4 |
2 |
p. v-vi nvt p. |
artikel |
6 |
Facet-defining inequalities for the simple graph partitioning polytope
|
Sørensen, Michael M. |
|
2007 |
4 |
2 |
p. 221-231 11 p. |
artikel |
7 |
Generalizing the induced matching by edge capacity constraints
|
Fukunaga, Takuro |
|
2007 |
4 |
2 |
p. 198-205 8 p. |
artikel |
8 |
On the complexity of cake cutting
|
Woeginger, Gerhard J. |
|
2007 |
4 |
2 |
p. 213-220 8 p. |
artikel |
9 |
On the job rotation problem
|
Butkovič, Peter |
|
2007 |
4 |
2 |
p. 163-174 12 p. |
artikel |
10 |
Two-dimensional bin packing with one-dimensional resource augmentation
|
Bansal, Nikhil |
|
2007 |
4 |
2 |
p. 143-153 11 p. |
artikel |
11 |
Two-machine open shop problem with controllable processing times
|
Cheng, T.C. Edwin |
|
2007 |
4 |
2 |
p. 175-184 10 p. |
artikel |