nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
1 |
A hybrid approach for biobjective optimization
|
Stidsen, Thomas |
|
|
28 |
C |
p. 89-114 |
artikel |
2 |
Complexity of min–max–min robustness for combinatorial optimization under discrete uncertainty
|
Buchheim, Christoph |
|
|
28 |
C |
p. 1-15 |
artikel |
3 |
Discrete convexity in joint winner property
|
Iwamasa, Yuni |
|
|
28 |
C |
p. 78-88 |
artikel |
4 |
Editorial Board
|
|
|
|
28 |
C |
p. ii |
artikel |
5 |
Erratum to “Intersection cuts–standard versus restricted” [Discrete Optim. 18 (2015) 189–192] [1]
|
Balas, Egon |
|
|
28 |
C |
p. 115 |
artikel |
6 |
Linear-time recognition of map graphs with outerplanar witness
|
Mnich, Matthias |
|
|
28 |
C |
p. 63-77 |
artikel |
7 |
On the complexity of energy storage problems
|
Halman, Nir |
|
|
28 |
C |
p. 31-53 |
artikel |
8 |
On the NP-hardness of scheduling with time restrictions
|
Zhang, An |
|
|
28 |
C |
p. 54-62 |
artikel |
9 |
Total dominating sequences in trees, split graphs, and under modular decomposition
|
Brešar, Boštjan |
|
|
28 |
C |
p. 16-30 |
artikel |