nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
Approximation of the Quadratic Set Covering problem
|
Escoffier, Bruno |
|
2007 |
4 |
3-4 |
p. 378-386 9 p. |
artikel |
2 |
A strongly polynomial algorithm for line search in submodular polyhedra
|
Nagano, Kiyohito |
|
2007 |
4 |
3-4 |
p. 349-359 11 p. |
artikel |
3 |
Biclique completion problems for multicast network design
|
Faure, Nathalie |
|
2007 |
4 |
3-4 |
p. 360-377 18 p. |
artikel |
4 |
Computing integral solutions of complementarity problems
|
van der Laan, Gerard |
|
2007 |
4 |
3-4 |
p. 315-321 7 p. |
artikel |
5 |
Finding well-balanced pairs of edge-disjoint trees in edge-weighted graphs
|
Bang-Jensen, Jørgen |
|
2007 |
4 |
3-4 |
p. 334-348 15 p. |
artikel |
6 |
Linear-programming design and analysis of fast algorithms for Max 2-CSP
|
Scott, Alexander D. |
|
2007 |
4 |
3-4 |
p. 260-287 28 p. |
artikel |
7 |
Online bin packing with resource augmentation
|
Epstein, Leah |
|
2007 |
4 |
3-4 |
p. 322-333 12 p. |
artikel |
8 |
Peter Ladislaw Hammer
|
Boros, Endre |
|
2007 |
4 |
3-4 |
p. 257-259 3 p. |
artikel |
9 |
Strong polynomiality of resource constraint propagation
|
Mercier, Luc |
|
2007 |
4 |
3-4 |
p. 288-314 27 p. |
artikel |