Printable schedule (PDF)

Sunday, June 24
16:00-18:00 Reception, Becker House Dining Room
Monday, June 25
08:00-09:00 Registration, Sibley Lounge, Upson 117
08:30-09:00 Continental breakfast, Sibley Lounge, Upson 117
09:00-10:30 Session 1, Upson B17
Inequalities from Two Rows of a Simplex Tableau
Kent Andersen, Quentin Louveaux, Robert Weismantel, and Laurence A. Wolsey
Cuts for Conic Mixed-Integer Programming
Alper Atamtürk and Vishnu Narayanan
Sequential-Merge Facets for Two-Dimensional Group Problems
Santanu S. Dey and Jean-Philippe P. Richard
10:30-11:00 Coffee break, Sibley Lounge, Upson 117
11:00-12:30 Session 2, Upson B17
Triangle-free Simple 2-Matchings in Subcubic Graphs
David Hartvigsen and Yanjun Li
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Rene Beier, Heiko Röglin, and Berthold Vöcking
Finding a Polytope from Its Graph in Polynomial Time
Eric J. Friedman
12:30-14:30 Lunch
14:30-16:00 Session 3, Upson B17
Orbitopal Fixing
Volker Kaibel, Matthias Peinhardt, and Marc E. Pfetsch
New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing
Egon Balas and Pierre Bonami
Orbital Branching
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, and Stefano Smriglio
16:00-16:30 Coffee break, Sibley Lounge, Upson 117
16:30-18:00 Session 4, Upson B17
Distinct Triangle Areas in a Planar Point Set
Adrian Dumitrescu and Csaba D. Tóth
Scheduling with Precedence Constraints of Low Fractional Dimension
Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, and Ola Svensson
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
David B. Shmoys and Mauro Sozio
Tuesday, June 26
08:30-09:00 Continental breakfast, Sibley Lounge, Upson 117
09:00-10:30 Session 5, Upson B17
On Integer Programming and the Branch-Width of the Constraint Matrix
William H. Cunningham and Jim Geelen
Parity Problems in Polymatroids Without Double Circuits
Márton Makai, Gyula Pap, and Jácint Szabó
Maximizing a Submodular Set Function Subject to a Matroid Constraint
Gruia Calinescu, Chandra Chekuri, Martin Pál, and Jan Vondrák
10:30-11:00 Coffee break, Sibley Lounge, Upson 117
11:00-12:30 Session 6, Upson B17
On The Generalized Master Cyclic Group Polyhedron
Sanjeeb Dash, Ricardo Fukasawa, and Oktay Günlük.
A General Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications
Bo Zeng and Jean-Philippe P. Richard
On the Exact Separation of Mixed Integer Knapsack Cuts
Ricardo Fukasawa and Marcos Goycoolea
12:30-14:30 Lunch
14:30-16:00 Session 7, Upson B17
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization
James B. Orlin
On Convex Minimization over Base Polytopes
Kiyohito Nagano
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
Toshinari Itoko and Satoru Iwata
16:00-16:30 Coffee break, Sibley Lounge, Upson 117
16:30-18:00 Session 8, Upson B17
Generating Multiple Solutions for Mixed Integer Programming Problems
Emilie Danna, Mary Fenelon, Zonghao Gu, and Roland Wunderling
A Branch and Bound Algorithm for Max- Cut Based on Combining Semidefinite and Polyhedral Relaxations
Franz Rendl, Giovanni Rinaldi and Angelika Wiegele
DINS, a MIP Improvement Heuristic
Shubhashis Ghosh
19:00-22:00 Conference Banquet, Cornell Lab of Ornithology
Wednesday, June 27
08:30-09:00 Continental breakfast, Sibley Lounge, Upson 117
09:00-10:30 Session 9, Upson B17
Mixed-Integer Vertex Covers on Bipartite Graphs
Michele Conforti, Bert Gerards, and Giacomo Zambelli.
On the MIR Closure of Polyhedra
Sanjeeb Dash, Oktay Günlük, and Andrea Lodi
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Michele Conforti, Marco Di Summa and Laurence A. Wolsey
10:30-11:00 Coffee break, Sibley Lounge, Upson 117
11:00-12:30 Session 10, Upson B17
Simple Explicit Formula for Counting Lattice Points in Polyhedra
Jean B. Lasserre and Eduardo S. Zeron
Characterizations of Total Dual Integrality
Edwin O'Shea and András Sebő
Sign-Solvable Linear Complementarity Problems
Naonori Kakimura
12:30-14:30 Lunch
14:30-16:00 Session 11, Upson B17
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
James Luedtke, Shabbir Ahmed, and George Nemhauser
Infrastructure Leasing Problems
Barbara M. Anthony and Anupam Gupta
Robust Combinatorial Optimization with Exponential Scenarios
Uriel Feige, Kamal Jain, Mohammad Mahdian, and Vahab Mirrokni
16:00-16:30 Coffee break, Sibley Lounge, Upson 117
16:30-18:00 Session 12, Upson B17
Approximation Algorithms for the Multi-Item Capacitated Lot-Sizing Problem via Flow-Cover Inequalities
Retsef Levi, Andrea Lodi, and Maxim Sviridenko
Optimal Efficiency Guarantees for Network Design
Tim Roughgarden and Mukund Sundararajan
The Set Connector Problem in Graphs
Takuro Fukunaga and Hiroshi Nagamochi