IPCO 2008 Conference program
Session 1 (Monday, May 26, 9:00  10:30)

Perspective Relaxation of MINLPs with Indicator Variables
Oktay Günlük and Jeff Linderoth
Disjunctive Cuts for Nonconvex Mixed Integer Quadratically Constrained Quadratic Programs
Anureet Saxena, Pierre Bonami and Jon Lee
The Air Traffic Flow Management Problem: An Integer Optimization Approach
Dimitris Bertsimas, Guglielmo Lulli and Amedeo Odoni
Session 2 (Monday, May 26, 11:00  13:00)

The Induced Disjoint Paths Problem
Kenichi Kawarabayashi and Yusuke Kobayashi
A Weighted K_{t,t}Free tFactor Algorithm for Bipartite Graphs
Kenjiro Takazawa
A New Algorithm for the Maximum Weighted Stable Set Problem in ClawFree Graphs
Gianpaolo Oriolo, Ugo Pietropaoli and Gautier Stauffer
A Polynomial Algorithm for Weighted Abstract Flow
Maren Martens and S. Tom McCormick
Session 3 (Monday, May 26, 15:00  16:30)

A Comparative Study of Linear and Semidefinite
BranchandCut
Methods for Solving the Minimum Graph Bisection Problem
Michael Armbruster, Marzena Fuegenschuh, Christoph Helmberg and Alexander Martin
Binary Positive Semidefinite Matrices and Associated Integer Polytopes
Adam N. Letchford and Michael Sørensen
Vertex Cover Resists SDPs Tightened by Local Hypermetric Inequalities
Konstantinos Georgiou, Avner Magen and Iannis Tourlakis
Session 4 (Monday, May 26, 17:00  18:30)

Tight Bounds for Permutation Flow Shop Scheduling
Viswanath Nagarajan and Maxim Sviridenko
The Stochastic Machine Replenishment Problem
Kamesh Munagala and Peng Shi
A Polynomial Time Approximation Scheme for the Square Packing Problem
Klaus Jansen and Roberto SolisOba
Session 5 (Tuesday, May 27, 9:00  10:30)

Modeling Disjunctive Constraints with a Logarithmic Number
of
Binary Variables and Constraints
Juan Pablo Vielma and George L. Nemhauser
Computing with MultiRow Gomory Cuts
Daniel G. Espinoza
Constraint Orbital Branching
James Ostrowski, Jeff Linderoth, Fabrizio Rossi and Stefano Smriglio
Session 6 (Tuesday, May 27, 11:00  12:30)

A Fast, Simpler Algorithm for the Matroid Parity Problem
James B. Orlin
Degree Bounded Matroids and Submodular Flows
Tamás Király, Lap Chi Lau and Mohit Singh
Budgeted Matching and Budgeted Matroid Intersection via the Gasoline Puzzle
André Berger, Vincenzo Bonifaci, Fabrizio Grandoni and Guido Schäfer
Session 7 (Tuesday, May 27, 14:30  16:00)

PrimalDual Schema for Capacitated Covering Problems
Timothy Carnes and David Shmoys
Offline and Online Facility Leasing
Chandrashekhar Nagarajan and David P. Williamson
Importance Sampling via LoadBalanced Facility Location
Aaron Archer and Shankar Krishnan
Session 8 (Tuesday, May 27, 16:30  18:00)

A Constant Approximation Algorithm for the a priori
Traveling Salesman Problem
David Shmoys and Kunal Talwar
New GeometryInspired Relaxations and Algorithms for the Metric Steiner Tree Problem
Deeparnab Chakrabarty, Nikhil R. Devanur and Vijay V. Vazirani
Min Sum Edge Coloring in General Multigraphs via Configuration LP
Magnus Halldórsson, Guy Kortsarz and Maxim Sviridenko
Session 9 (Wednesday, May 28, 9:00  10:30)

An Improved Algorithm for Finding Cycles through Elements
Kenichi Kawarabayashi
The Stable Roommates Problem with Choice Functions
Tamás Fleiner
A New Approach to SplittingOff
Attila Bernáth and Tamás Király
Session 10 (Wednesday, May 28, 11:00  13:00)

Can Pure Cutting Plane Algorithms Work?
Arrigo Zanette, Matteo Fischetti and Egon Balas
The Mixing Set with Divisible Capacities
Michele Conforti, Marco Di Summa and Laurence A. Wolsey
A Polynomial Time Algorithm for Stochastic Uncapacitated LotSizing Problem with Backlogging
Yongpei Guan and Andrew Miller
Lifting Integer Variables In Minimal Inequalities Corresponding To LatticeFree Triangles
Santanu S. Dey and Laurence A. Wolsey