Integer Programming Submissions  2006
January 2006
(Mixed) Integer Linear Programming
Two Families of Facets for the TwoDimensional Mixed Integer Infinite Group Problem
Santanu Dey, JeanPhilippe Richard
01 Programming
Cliquebased facets for the precedence constrained knapsack problem
Natashia Boland, Christopher Fricke, Gary Froyland, Renata Sotirov
February 2006
(Mixed) Integer Nonlinear Programming
A Feasibility Pump for Mixed Integer Nonlinear Programs
Pierre Bonami, Gérard Cornuéjols, Andrea Lodi, Francois Margot
March 2006
01 Programming
A robust approach to the chanceconstrained knapsack problem
Olivier Klopfenstein, Dritan Nace
01 Programming
Packing and Partitioning Orbitopes
Volker Kaibel, Marc E. Pfetsch
April 2006
Cutting Plane Approaches
Extreme inequalities for infinite group problems
Santanu S. Dey, JeanPhilippe P. Richard, Lisa A. Miller, Yanjun Li
May 2006
Cutting Plane Approaches
New Inequalities for Finite and Infinite Group Problems from Approximate Lifting
Lisa A. Miller, Yanjun Li, JeanPhilippe P. Richard
Cutting Plane Approaches
Robust BranchCutandPrice for the Capacitated Minimum Spanning Tree Problem over a Large Extended Formulation
Eduardo Uchoa, Ricardo Fukasawa, Jens Lysgaard, Artur Pessoa, Marcus Poggi de Aragão, Diogo Andrade
June 2006
Cutting Plane Approaches
Linear Programming Based Lifting and its Application to Primal Cutting Plane Algorithms
Santanu Dey, JeanPhilippe Richard
(Mixed) Integer Linear Programming
On the strength of Gomory mixedinteger cuts as group cuts
Sanjeeb Dash, Oktay Gunluk
(Mixed) Integer Linear Programming
Generalized Mixed Integer Rounding Valid Inequalities
Kiavash Kianfar, Yahya Fathi
July 2006
Cutting Plane Approaches
Two step MIR inequalities for mixedinteger programs
Sanjeeb Dash, Marcos Goycoolea, Oktay Gunluk
Cutting Plane Approaches
Two step MIR inequalities for mixedinteger programs
Sanjeeb Dash, Marcos Goycoolea, Oktay Gunluk
September 2006
Cutting Plane Approaches
Sequence independent lifting for 01 knapsack problems with disjoint cardinality constraints
Bo Zeng, JeanPhilippe Richard
(Mixed) Integer Linear Programming
nstep MIR Functions: Facets for Finite and Infinite Group Problems
Kiavash Kianfar, Yahya Fathi
October 2006
(Mixed) Integer Linear Programming
Lookahead Branching for Mixed Integer Programming
Wasu Glankwamdee, Jeff Linderoth
Cutting Plane Approaches
On the complexity of cutting plane proofs using split cuts
Sanjeeb Dash
Approximate formulations for 01 knapsack sets
Daniel Bienstock
November 2006
The MixingMIR Set with Divisible Capacities
Ming Zhao, Ismael de Farias
Cardinality Cuts: New Cutting Planes for 01 Programming
Osman Oguz
01 Programming
Orbital Branching
James Ostrowski, Jeff Linderoth, Fabrizio Rossi, Stefano Smriglio
01 Programming
A Branch and Bound Algorithm for MaxCut based on combining semidefinite and polyhedral relaxations
Franz Rendl, Giovanni Rinaldi, Angelika Wiegele
01 Programming
Orbitopal Fixing
Volker Kaibel, Peinhardt Matthias, Marc E. Pfetsch
