nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A dual ascent heuristic for obtaining a lower bound of the generalized set partitioning problem with convexity constraints
|
Pan, Stefania |
|
2019 |
33 |
C |
p. 146-168 |
artikel |
2 |
An efficient algorithm for packing cuts and (2,3)-metrics in a planar graph with three holes
|
Karzanov, Alexander V. |
|
2019 |
33 |
C |
p. 118-139 |
artikel |
3 |
A note on submodular function minimization by Chubanov’s LP algorithm
|
Fujishige, Satoru |
|
2019 |
33 |
C |
p. 140-145 |
artikel |
4 |
Combinatorial optimization with interaction costs: Complexity and solvable cases
|
Lendl, Stefan |
|
2019 |
33 |
C |
p. 101-117 |
artikel |
5 |
Editorial Board
|
|
|
2019 |
33 |
C |
p. ii |
artikel |
6 |
Global optimization of multilevel electricity market models including network design and graph partitioning
|
Kleinert, Thomas |
|
2019 |
33 |
C |
p. 43-69 |
artikel |
7 |
Planar multifacility location problems with tree structure and finite dominating sets
|
Maier, Andrea |
|
2019 |
33 |
C |
p. 19-42 |
artikel |
8 |
Robust algorithms for total completion time
|
Epstein, Leah |
|
2019 |
33 |
C |
p. 70-86 |
artikel |
9 |
Star partitions on graphs
|
Andreatta, G. |
|
2019 |
33 |
C |
p. 1-18 |
artikel |
10 |
Vehicle routing with subtours
|
Held, Stephan |
|
2019 |
33 |
C |
p. 87-100 |
artikel |