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
Electronic Edition (link) BibTeX
- Yann Hendel, Nina Runge, Francis Sourd:
The one-machine just-in-time scheduling problem with preemption.
10-22
Electronic Edition (link) BibTeX
- Toshimasa Ishii:
Minimum augmentation of edge-connectivity with monotone requirements in undirected graphs.
23-36
Electronic Edition (link) BibTeX
- Hiroo Saito, Tetsuya Fujie, Tomomi Matsui, Shiro Matuura:
A study of the quadratic semi-assignment polytope.
37-50
Electronic Edition (link) BibTeX
- Javier Marenco, Annegret Wagler:
Cycle-based facets of chromatic scheduling polytopes.
51-63
Electronic Edition (link) BibTeX
- Javier Marenco, Annegret Wagler:
Facet-inducing inequalities for chromatic scheduling polytopes based on covering cliques.
64-78
Electronic Edition (link) BibTeX
- Wieslaw Kubiak, Djamal Rebaine, Chris Potts:
Optimality of HLF for scheduling divide-and-conquer UET task graphs on identical parallel processors.
79-91
Electronic Edition (link) BibTeX
- Maxim A. Babenko, Alexander V. Karzanov:
Minimum mean cycle problem in bidirected and skew-symmetric graphs.
92-97
Electronic Edition (link) BibTeX
- Christian Liebchen, Leon Peeters:
Integral cycle bases for cyclic timetabling.
98-109
Electronic Edition (link) BibTeX
- Vincent Poirriez, Nicola Yanev, Rumen Andonov:
A hybrid algorithm for the unbounded knapsack problem.
110-124
Electronic Edition (link) BibTeX
- Sanming Zhou:
Minimum partition of an independence system into independent sets.
125-133
Electronic Edition (link) BibTeX
Volume 6,
Number 2,
May 2009
Copyright © Sat May 16 23:56:38 2009
by Michael Ley (ley@uni-trier.de)
