Volume 112, Number 1-3, September 2001
Combinatorial Optimization Symposium, Selected Papers, Brussels, 15-17 April 98
- Martine Labbé, Gilbert Laporte, Silvano Martello:
Preface.
1
- Mourad Baïou:
On the dominant of the Steiner 2-edge connected subgraph polytope.
3-10
- Ralf Borndörfer, Robert Weismantel:
Discrete relaxations of combinatorial programs.
11-26
- Cristina C. B. Cavalcante, C. Carvalho de Souza, Martin W. P. Savelsbergh, Y. Wang, Laurence A. Wolsey:
Scheduling projects with labor constraints.
27-52
- Giuseppe Confessore, Paolo Dell'Olmo, Stefano Giordani:
An approximation result for a periodic allocation problem.
53-72
- Teodor Gabriel Crainic, Antonio Frangioni, Bernard Gendron:
Bundle-based relaxation methods for multicommodity capacitated fixed charge network design.
73-99
- Mohamed Didi Biha, Hervé Kerivin, Ali Ridha Mahjoub:
Steiner trees and polyhedra.
101-120
- Samuel Fiorini:
Determining the automorphism group of the linear ordering polytope.
121-128
- Luis Gouveia, Jose Manuel Pires:
The asymmetric travelling salesman problem: on generalizations of disaggregated Miller-Tucker-Zemlin constraints.
129-145
- Mark E. Hartmann, Özgür Özlük:
Facets of the p-cycle polytope.
147-178
- Johann Hurink, Jens Keuchel:
Local search algorithms for a single-machine scheduling problem with positive and negative time-lags.
179-197
- Johann Hurink, Sigrid Knust:
Makespan minimization for flow-shop problems with transportation times and a single robot.
199-216
- Brigitte Jaumard, Odile Marcotte, Christophe Meyer, Tsevi Vovor:
Comparison of column generation models for channel assignment in cellular networks.
217-240
- Tobias Polzin, Siavash Vahdati Daneshmand:
A comparison of Steiner tree relaxations.
241-261
- Tobias Polzin, Siavash Vahdati Daneshmand:
Improved algorithms for the Steiner problem in networks.
263-300
- H. Edwin Romeijn, Dolores Romero Morales:
A probabilistic analysis of the multi-period single-sourcing problem.
301-328
Last update Sat May 18 20:20:28 2013
CET by the DBLP Team — 
Data released under the ODC-BY 1.0 license — See also our legal information page
