12. IPCO 2007: Ithaca, NY, USA

• Kent Andersen, Quentin Louveaux, Robert Weismantel, Laurence A. Wolsey:
  Inequalities from Two Rows of a Simplex Tableau. 1-15
  
• Alper Atamtürk, Vishnu Narayanan:
  Cuts for Conic Mixed-Integer Programming. 16-29
  
• Santanu S. Dey, Jean-Philippe P. Richard:
  Sequential-Merge Facets for Two-Dimensional Group Problems. 30-42
  
• David Hartvigsen, Yanjun Li:
  Triangle-Free Simple 2-Matchings in Subcubic Graphs (Extended Abstract). 43-52
  
• René Beier, Heiko Röglin, Berthold Vöcking:
  The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization. 53-67
  
• Eric J. Friedman:
  Finding a Polytope from Its Graph in Polynomial Time. 68-73
  
• Volker Kaibel, Matthias Peinhardt, Marc E. Pfetsch:
  Orbitopal Fixing. 74-88
  
• Egon Balas, Pierre Bonami:
  New Variants of Lift-and-Project Cut Generation from the LP Tableau: Open Source Implementation and Testing. 89-103
  
• James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio:
  Orbital Branching. 104-118
  
• Adrian Dumitrescu, Csaba D. Tóth:
  Distinct Triangle Areas in a Planar Point Set. 119-129
  
• Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson:
  Scheduling with Precedence Constraints of Low Fractional Dimension. 130-144
  
• David B. Shmoys, Mauro Sozio:
  Approximation Algorithms for 2-Stage Stochastic Scheduling Problems. 145-157
  
• William H. Cunningham, Jim Geelen:
  On Integer Programming and the Branch-Width of the Constraint Matrix. 158-166
  
• Márton Makai, Gyula Pap, Jácint Szabó:
  Matching Problems in Polymatroids Without Double Circuits. 167-181
  
• Gruia Calinescu, Chandra Chekuri, Martin Pál, Jan Vondrák:
  Maximizing a Submodular Set Function Subject to a Matroid Constraint (Extended Abstract). 182-196
  
• Sanjeeb Dash, Ricardo Fukasawa, Oktay Günlük:
  On a Generalization of the Master Cyclic Group Polyhedron. 197-209
  
• Bo Zeng, Jean-Philippe P. Richard:
  A Framework to Derive Multidimensional Superadditive Lifting Functions and Its Applications. 210-224
  
• Ricardo Fukasawa, Marcos Goycoolea:
  On the Exact Separation of Mixed Integer Knapsack Cuts. 225-239
  
• James B. Orlin:
  A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization. 240-251
  
• Kiyohito Nagano:
  On Convex Minimization over Base Polytopes. 252-266
  
• Toshinari Itoko, Satoru Iwata:
  Computational Geometric Approach to Submodular Function Minimization for Multiclass Queueing Systems. 267-279
  
• Emilie Danna, Mary Fenelon, Zonghao Gu, Roland Wunderling:
  Generating Multiple Solutions for Mixed Integer Programming Problems. 280-294
  
• Franz Rendl, Giovanni Rinaldi, Angelika Wiegele:
  A Branch and Bound Algorithm for Max-Cut Based on Combining Semidefinite and Polyhedral Relaxations. 295-309
  
• Shubhashis Ghosh:
  DINS, a MIP Improvement Heuristic. 310-323
  
• Michele Conforti, Bert Gerards, Giacomo Zambelli:
  Mixed-Integer Vertex Covers on Bipartite Graphs. 324-336
  
• Sanjeeb Dash, Oktay Günlük, Andrea Lodi:
  On the MIR Closure of Polyhedra. 337-351
  
• Michele Conforti, Marco Di Summa, Laurence A. Wolsey:
  The Intersection of Continuous Mixing Polyhedra and the Continuous Mixing Polyhedron with Flows. 352-366
  
• Jean B. Lasserre, Eduardo S. Zeron:
  Simple Explicit Formula for Counting Lattice Points of Polyhedra. 367-381
  
• Edwin O'Shea, András Sebö:
  Characterizations of Total Dual Integrality. 382-396
  
• Naonori Kakimura:
  Sign-Solvable Linear Complementarity Problems. 397-409
  
• James Luedtke, Shabbir Ahmed, George L. Nemhauser:
  An Integer Programming Approach for Linear Programs with Probabilistic Constraints. 410-423
  
• Barbara M. Anthony, Anupam Gupta:
  Infrastructure Leasing Problems. 424-438
  
• Uriel Feige, Kamal Jain, Mohammad Mahdian, Vahab S. Mirrokni:
  Robust Combinatorial Optimization with Exponential Scenarios. 439-453
  
• Retsef Levi, Andrea Lodi, Maxim Sviridenko:
  Approximation Algorithms for the Multi-item Capacitated Lot-Sizing Problem Via Flow-Cover Inequalities. 454-468
  
• Tim Roughgarden, Mukund Sundararajan:
  Optimal Efficiency Guarantees for Network Design Mechanisms. 469-483
  
• Takuro Fukunaga, Hiroshi Nagamochi:
  The Set Connector Problem in Graphs. 484-498