Volume 6,
Number 1,
February 2009
- Jean-Paul Doignon, Samuel Fiorini, Gwenaël Joret:
Weighted graphs defining facets: A connection between stable set and linear ordering polytopes.
1-9
- Yann Hendel, Nina Runge, Francis Sourd:
The one-machine just-in-time scheduling problem with preemption.
10-22
- Toshimasa Ishii:
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.
23-36
- Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura:
A study of the quadratic semi-assignment polytope.
37-50
- Javier Marenco, Annegret Wagler:
Cycle-based facets of chromatic scheduling polytopes.
51-63
- Javier Marenco, Annegret Wagler:
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
64-78
- Wieslaw Kubiak, Djamal Rebaine, Chris Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
79-91
- Maxim A. Babenko, Alexander V. Karzanov:
Minimum mean cycle problem in bidirected and skew-symmetric graphs.
92-97
- Christian Liebchen, Leon Peeters:
Integral cycle bases for cyclic timetabling.
98-109
- Vincent Poirriez, Nicola Yanev, Rumen Andonov:
A hybrid algorithm for the unbounded knapsack problem.
110-124
- Sanming Zhou:
Minimum partition of an independence system into independent sets.
125-133
Volume 6,
Number 2,
May 2009
Copyright © Wed Nov 25 19:07:38 2009
by Michael Ley (ley@uni-trier.de)