----------------------------------------------------------------
IPCO XIII, 2008 (Bertinoro): List of accepted papers
----------------------------------------------------------------
Viswanath Nagarajan and Maxim Sviridenko
Tight Bounds for Permutation Flow Shop Scheduling
Michael Armbruster, Marzena Fuegenschuh, Christoph Helmberg and Alexander Martin
A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving
the Minimum Graph Bisection Problem
Kamesh Munagala and Peng Shi
The Stochastic Machine Replenishment Problem
James Orlin
A Fast, Simpler Algorithm for the Matroid Parity Problem
Arrigo Zanette, Matteo Fischetti and Egon Balas
Can pure cutting plane algorithms work?
Tamas Kiraly, Lap Chi Lau and Mohit Singh
Degree Bounded Matroids and Submodular Flows
Ken-ichi Kawarabayashi and Yusuke Kobayashi
The Induced Disjoint Paths Problem
Timothy Carnes and David Shmoys
Primal-Dual Schema for Capacitated Covering Problems
David Shmoys and Kunal Talwar
A constant approximation algorithm for the a priori traveling salesman problem
Juan Pablo Vielma and George Nemhauser
Modeling Disjunctive Constraints with a Logarithmic Number of Binary Variables
and Constraints
Adam Letchford and Michael Soerensen
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
Michele Conforti, Marco Di Summa and Laurence Wolsey
The mixing set with divisible capacities
Roberto Solis-Oba and Klaus Jansen
A Polynomial Time Approximation Scheme for the Square Packing Problem
Santanu Dey and Laurence Wolsey
Lifting Integer Variables In Minimal Inequalities Corresponding To Lattice-Free Triangles
Dimitris Bertsimas, Guglielmo Lulli and Amedeo Odoni
The Air Traffic Flow Management Problem: An Integer Optimization Approach
Chandrashekhar Nagarajan and David P. Williamson
Offline and Online Facility Leasing
Maren Martens and Tom McCormick
A Polynomial Algorithm for Weighted Abstract Flow
Ken-ichi Kawarabayashi
An improved algorithm for finding cycles through elements
Kenjiro Takazawa
A weighted K_{t,t}-free t-factor algorithm for bipartite graphs
Tamas Fleiner
The stable roommates problem with choice functions
Daniel Espinoza
Computing with multi-row Gomory cuts
Andre Berger, Vincenzo Bonifaci, Fabrizio Grandoni and Guido Schaefer
Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
James Ostrowski, Jeff Linderoth, Fabrizio Rossi and Stefano Smriglio
Constraint Orbital Branching
Oktay Gunluk and Jeff Linderoth
Perspective Relaxation of MINLPs with Indicator Variables
Attila BernĂ¡th and Tamas Kiraly
A new approach to splitting-off
Deeparnab Chakrabarty, Nikhil R. Devanur and Vijay Vazirani
New Geometry-Inspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Aaron Archer and Shankar Krishnan
Importance sampling via load-balanced facility location
Gianpaolo Oriolo, Ugo Pietropaoli and Gautier Stauffer
A new algorithm for the maximum weighted stable set problem in claw-free graphs
Magnus Halldorsson, Guy Kortsarz and Maxim Sviridenko
Min Sum Edge Coloring in General Multigraphs via Configuration LP
Konstantinos Georgiou, Avner Magen and Iannis Tourlakis
Vertex Cover resists SDPs tightened by local hypermetric inequalities
Anureet Saxena, Pierre Bonami and Jon Lee
Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Quadratic Programs
Yongpei Guan and Andrew Miller
A Polynomial Time Algorithm for Stochastic Uncapacitated Lot-Sizing Problem with Backlogging