| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A comparison of Steiner tree relaxations
|
Polzin, Tobias
|
|
2001
|
112 |
1-3 |
p. 241-261
21 p.
|
article
|
| 2 |
An approximation result for a periodic allocation problem
|
Confessore, Giuseppe
|
|
2001
|
112 |
1-3 |
p. 53-72
20 p.
|
article
|
| 3 |
A probabilistic analysis of the multi-period single-sourcing problem
|
Romeijn, H.Edwin
|
|
2001
|
112 |
1-3 |
p. 301-328
28 p.
|
article
|
| 4 |
Author Index to Volume 112 (2001)
|
|
|
2001
|
112 |
1-3 |
p. 329-
1 p.
|
article
|
| 5 |
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design
|
Crainic, Teodor Gabriel
|
|
2001
|
112 |
1-3 |
p. 73-99
27 p.
|
article
|
| 6 |
Comparison of column generation models for channel assignment in cellular networks
|
Jaumard, Brigitte
|
|
2001
|
112 |
1-3 |
p. 217-240
24 p.
|
article
|
| 7 |
Determining the automorphism group of the linear ordering polytope
|
Fiorini, Samuel
|
|
2001
|
112 |
1-3 |
p. 121-128
8 p.
|
article
|
| 8 |
Discrete relaxations of combinatorial programs
|
Borndörfer, Ralf
|
|
2001
|
112 |
1-3 |
p. 11-26
16 p.
|
article
|
| 9 |
Facets of the p-cycle polytope
|
Hartmann, Mark
|
|
2001
|
112 |
1-3 |
p. 147-178
32 p.
|
article
|
| 10 |
Improved algorithms for the Steiner problem in networks
|
Polzin, Tobias
|
|
2001
|
112 |
1-3 |
p. 263-300
38 p.
|
article
|
| 11 |
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags
|
Hurink, Johann
|
|
2001
|
112 |
1-3 |
p. 179-197
19 p.
|
article
|
| 12 |
Makespan minimization for flow-shop problems with transportation times and a single robot
|
Hurink, Johann
|
|
2001
|
112 |
1-3 |
p. 199-216
18 p.
|
article
|
| 13 |
On the dominant of the Steiner 2-edge connected subgraph polytope
|
Baı̈ou, Mourad
|
|
2001
|
112 |
1-3 |
p. 3-10
8 p.
|
article
|
| 14 |
Preface
|
Labbé, Martine
|
|
2001
|
112 |
1-3 |
p. 1-
1 p.
|
article
|
| 15 |
Scheduling projects with labor constraints
|
Cavalcante, C.C.B.
|
|
2001
|
112 |
1-3 |
p. 27-52
26 p.
|
article
|
| 16 |
Steiner trees and polyhedra
|
Didi Biha, M.
|
|
2001
|
112 |
1-3 |
p. 101-120
20 p.
|
article
|
| 17 |
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller–Tucker–Zemlin constraints
|
Gouveia, Luis
|
|
2001
|
112 |
1-3 |
p. 129-145
17 p.
|
article
|
Journal description