| nr |
titel |
auteur |
tijdschrift |
jaar |
jaarg. |
afl. |
pagina('s) |
type |
| 1 |
A computational comparison of flow formulations for the capacitated location-routing problem
|
Contardo, Claudio
|
|
2013
|
10 |
4 |
p. 263-295
33 p.
|
artikel
|
| 2 |
A local search algorithm for binary maximum 2-path partitioning
|
Hassin, Refael
|
|
2013
|
10 |
4 |
p. 333-360
28 p.
|
artikel
|
| 3 |
A note on the complexity of the maximum edge clique partitioning problem with respect to the clique number
|
Sukegawa, Noriyoshi
|
|
2013
|
10 |
4 |
p. 331-332
2 p.
|
artikel
|
| 4 |
A polynomial time algorithm for makespan minimization on one machine with forbidden start and completion times
|
Rapine, Christophe
|
|
2013
|
10 |
4 |
p. 241-250
10 p.
|
artikel
|
| 5 |
A polynomial time algorithm for unloading boxes off a gravity conveyor
|
Baptiste, Pierre
|
|
2013
|
10 |
4 |
p. 251-262
12 p.
|
artikel
|
| 6 |
Computing minimum multiway cuts in hypergraphs
|
Fukunaga, Takuro
|
|
2013
|
10 |
4 |
p. 371-382
12 p.
|
artikel
|
| 7 |
Editorial Board
|
|
|
2013
|
10 |
4 |
p. IFC-
1 p.
|
artikel
|
| 8 |
Minimum number of queries for an adaptive liar search game with small sets
|
Meng, Kun
|
|
2013
|
10 |
4 |
p. 233-240
8 p.
|
artikel
|
| 9 |
Offline and online facility leasing
|
Nagarajan, Chandrashekhar
|
|
2013
|
10 |
4 |
p. 361-370
10 p.
|
artikel
|
| 10 |
Perfectness of clustered graphs
|
Bonomo, Flavia
|
|
2013
|
10 |
4 |
p. 296-303
8 p.
|
artikel
|
| 11 |
Searching for realizations of finite metric spaces in tight spans
|
Herrmann, Sven
|
|
2013
|
10 |
4 |
p. 310-319
10 p.
|
artikel
|
| 12 |
Sensitivity analysis to perturbations of the weight of a subset of items: The knapsack case study
|
Hifi, Mhand
|
|
2013
|
10 |
4 |
p. 320-330
11 p.
|
artikel
|
| 13 |
Sparse regular induced subgraphs in 2 P 3 -free graphs
|
Lozin, Vadim V.
|
|
2013
|
10 |
4 |
p. 304-309
6 p.
|
artikel
|
Tijdschrift beschrijving