Discrete Optimization, Volume 6

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

• Pierre Hansen, Martine Labbé, David Schindl:
  Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results. 135-147
  
• Jonna Gill, Svante Linusson:
  The k-assignment polytope. 148-161
  
• Gabriela R. Argiroffo, Silvia M. Bianchi:
  On the set covering polyhedron of circulant matrices. 162-173
  
• N. Ntene, J. H. van Vuuren:
  A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem. 174-188
  
• Kevin K. H. Cheung:
  A Benders approach for computing lower bounds for the mirrored traveling tournament problem. 189-196
  
• Refael Hassin, Asaf Levin, Shlomi Rubinstein:
  Approximation algorithms for maximum latency and partial cycle cover. 197-205
  
• Yu-Hin Au, Levent Tunçel:
  On the polyhedral lift-and-project methods and the fractional stable set polytope. 206-213
  
• Wayne Pullan:
  Optimisation of unweighted/weighted maximum independent sets and minimum vertex covers. 214-219
  
• S. I. Veselov, A. J. Chirkov:
  Integer program with bimodular matrix. 220-222