----------------------------------------------------------------
IPCO XII, 2007 (Ithaca): List of accepted papers
----------------------------------------------------------------
James Orlin
A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.
Jean B. Lasserre and Eduardo S. Zeron
Simple explicit formula for counting lattice points in polyhedra.
Michele Conforti, Marco Di Summa and Laurence Wolsey
The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows
Franz Rendl, Giovanni Rinaldi and Angelika Wiegele
A Branch and Bound Algorithm for Max-Cut based on combining semidefinite and polyhedral relaxations
Takuro Fukunaga and Hiroshi Nagamochi
The Set Connector Problem in Graphs
Shubhashis Ghosh
DINS, a MIP Improvement Heuristic
Kent Andersen, Laurence Wolsey, Robert Weismantel and Quentin Louveaux
Inequalities from two rows of a simplex tableau
James Luedtke, Shabbir Ahmed and George Nemhauser
An Integer Programming Approach for Linear Programs with Probabilistic Constraints
Eric Friedman
Finding a Polytope from its Graph in Polynomial Time
Barbara Anthony and Anupam Gupta
Infrastructure Leasing Problems
Christoph Ambuehl, Monaldo Mastrolilli, Nikolaus Mutsanas and Ola Nils Anders Svensson
Scheduling with Precedence Constraints of Low Fractional Dimension
Kiyohito Nagano
On Convex Minimization over Base Polytopes
Sanjeeb Dash, Oktay Gunluk and Andrea Lodi
On the MIR Closure of Polyhedra
Michele Conforti, Bert Gerards and Giacomo Zambelli
Mixed-integer vertex covers on bipartite graphs
Gruia Calinescu, Chandra Chekuri, Martin Pal and Jan Vondrak
Maximizing a Submodular Set Function subject to a Matroid Constraint
Uriel Feige, Kamal Jain, Mohammad Mahdian and Vahab Mirrokni
Robust Combinatorial Optimization with Exponential Scenarios
Naonori Kakimura
Sign-Solvable Linear Complementarity Problems
Toshinari Itoko and Satoru Iwata
Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems
Retsef Levi, Andrea Lodi and Maxim Sviridenko
Approximation Algorithms for the Multi-Item Capacitated Lot-Sizing Problem via Flow-Cover Inequalities
Santanu Dey and Jean-Philippe Richard
Facets for Two-dimensional Group Problem
David Shmoys and Mauro Sozio
Approximation Algorithms for 2-Stage Stochastic Scheduling Problems
Rene Beier, Heiko Roeglin and Berthold Voecking
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
Tim Roughgarden and Mukund Sundararajan
Optimal Efficiency Guarantees for Network Design
James Ostrowski, Jeff Linderoth, Fabrizio Rossi and Stefano Smriglio
Orbital Branching
David Hartvigsen and Yanjun Li
Triangle-free Simple 2-matchings in Subcubic Graphs
Edwin O'Shea and Andras Sebo
Characterizations of Total Dual Integrality
Egon Balas and Pierre Bonami
New variants of lift-and-project cut generation from the LP tableau: open source implementation and testing
Sanjeeb Dash, Ricardo Fukasawa and Oktay Gunluk
On The Generalized Master Knapsack Polyhedron
Ricardo Fukasawa and Marcos Goycoolea
On the Exact Separation of Mixed Integer Knapsack Cuts
Volker Kaibel, Matthias Peinhardt and Marc E. Pfetsch
Orbitopal Fixing
William H. Cunningham and Jim Geelen
On integer programming and the branch-width of the constraint matrix
Emilie Danna, Mary Fenelon, Zonghao Gu and Roland Wunderling
Generating multiple solutions for mixed integer programming problems
Alper Atamturk and Vishnu Narayanan
Cuts for Conic Mixed-Integer Programming
Bo Zeng and Jean-Philippe Richard
A general framework to derive multidimensional superadditive lifting functions and its applications
Adrian Dumitrescu and Csaba Toth
Distinct triangle areas in a planar point set
Marton Makai, Gyula Pap and Jacint Szabo
Parity problems in polymatroids without double circuits