Integer Programming Submissions  2011
January 2011
(Mixed) Integer Linear Programming
A Computational Study of Finitely Convergent Polyhedral Methods for General MixedInteger Linear Programs
Binyuan Chen, Dinakar Gade, Simge Kucukyavuz, Suvrajeet Sen
(Mixed) Integer Nonlinear Programming
Some Properties of Convex Hulls of Integer Points Contained in General Convex Sets
Santanu S. Dey, Diego A. Moran
(Mixed) Integer Nonlinear Programming
A Probing Algorithm for MINLP with Failure Prediction by SVM
Giacomo Nannicini, Pietro Belotti, Jon Lee, Jeff Linderoth, Francois Margot, Andreas Waechter
(Mixed) Integer Nonlinear Programming
CONVEX HULL RELAXATION (CHR) FOR CONVEX AND NONCONVEX MINLP PROBLEMS WITH LINEAR CONSTRAINTS
Aykut Ahlatçıoğlu, Monique Guignard
(Mixed) Integer Nonlinear Programming
A new, solvable, primal relaxation for convex nonlinear integer programming problems
Monique Guignard
(Mixed) Integer Nonlinear Programming
Combining QCR and CHR for Convex Quadratic MINLP Problems with Linear Constraints
Aykut Ahlatçıoğlu, Michael Bussieck, Mustafa Esen, Monique Guignard, Jan Jagla, Alexander Meeraus
February 2011
(Mixed) Integer Linear Programming
On the hyperplanes arrangements in mixedinteger techniques
Florin Stoican, Ionela Prodan, Sorin Olaru
(Mixed) Integer Nonlinear Programming
Reformulating mixedinteger quadratically constrained quadratic programs
Adam Letchford, Laura Galli
(Mixed) Integer Nonlinear Programming
Integer Factorization is in P
Yuly Shipilevsky
(Mixed) Integer Nonlinear Programming
Bound reduction using pairs of linear inequalities
Pietro Belotti
March 2011
(Mixed) Integer Nonlinear Programming
Lifted Inequalities for 0−1 MixedInteger Bilinear Covering Sets
Kwanghun Chung, JeanPhilippe P. Richard, Mohit Tawarmalani
Cutting Plane Approaches
A ChanceConstrained Model & Cutting Planes for Fixed Broadband Wireless Networks
Grit Claßen, David Coudert, Arie M. C. A. Koster, Napoleão Nepomuceno
(Mixed) Integer Linear Programming
Improving the LP bound of a MILP by dual concurrent branching and the relationship to cut generation methods
H. Georg Büsching
(Mixed) Integer Linear Programming
On nstep MIR and Partition Inequalities for\\ Integer Knapsack and Singlenode Capacitated Flow Sets
Kiavash Kianfar
(Mixed) Integer Linear Programming
Designing AC Power Grids using Integer Linear Programming
Stephan Lemkens, Arie M.C.A. Koster
Cutting Plane Approaches
An algorithm for the separation of tworow cuts
Quentin Louveaux, Laurent Poirrier
BranchandCut for Separable Piecewise Linear Optimization: New Inequalities and Intersection with SemiContinuous Constraints
Ming Zhao, Ismael de Farias
BranchandCut for Separable Piecewise Linear Optimization: Computation
Ismael de Farias, Rajat Gupta, Ernee Kozyreff, Ming Zhao
April 2011
(Mixed) Integer Nonlinear Programming
Inexact solution of NLP subproblems in MINLP
L. Min, L. N. Vicente
Cutting Plane Approaches
Design and Verify: A New Scheme for Generating CuttingPlanes
Santanu S. Dey, Sebastian Pokutta
May 2011
(Mixed) Integer Nonlinear Programming
Sampling Decisions in Optimum Experimental Design in the Light of Pontryagin's Maximum Principle
Sebastian Sager
June 2011
A Polyhedral Study of the SemiContinuous Knapsack Problem
Ismael de Farias, Ming Zhao
(Mixed) Integer Nonlinear Programming
An OuterInner Approximation for separable MINLPs
Hassan Hijazi, Pierre Bonami, Adam Ouorou
(Mixed) Integer Linear Programming
Computational Experiments with Cross and Crooked Cross Cuts
Sanjeeb Dash, Oktay Gunluk, Juan Pablo Vielma
Cutting Plane Approaches
Coordinated cutting plane generation via multiobjective separation
Edoardo Amaldi, Stefano Coniglio, Stefano Gualandi
July 2011
(Mixed) Integer Nonlinear Programming
Solving Mixed Integer Bilinear Problems using MIP formulations
Akshay Gupte, Shabbir Ahmed, Myun Seok Cheon, Santanu S. Dey
Column Generation for Extended Formulations
Ruslan Sadykov, Francois Vanderbeck
(Mixed) Integer Nonlinear Programming
Strong Dual for Conic MixedInteger Programs
Santanu S. Dey, Diego A. Moran R., Juan Pablo Vielma
On the generation of symmetry breaking constraints for mathematical programs
Leo Liberti, James Ostrowski
(Mixed) Integer Linear Programming
Algorithimic and Complexity Results for Cutting Planes Derived from Maximal LatticeFree Convex Sets
Amitabh Basu, Robert Hildebrand, Matthias Koeppe
August 2011
Cuts over Extended Formulations by Flow Discretization
Eduardo Uchoa
September 2011
(Mixed) Integer Nonlinear Programming
Strong Branching Inequalities for Convex Mixed Integer Nonlinear Programs
Mustafa Kilinc, Jeff Linderoth, James Luedtke, Andrew Miller
Cutting Plane Approaches
Lower bounds for ChvátalGomory style operators
Sebastian Pokutta
(Mixed) Integer Nonlinear Programming
Unbounded Convex Sets for NonConvex MixedInteger Quadratic Programming
Samuel Burer, Adam Letchford
Cutting Plane Approaches
A (k+1)Slope Theorem for the kDimensional Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Koeppe, Marco Molinaro
Latticefree sets, branching disjunctions, and mixedinteger programming
Sanjeeb Dash, Neil Dobbs, Oktay Gunluk, Tomasz Nowicki, Grzegorz Swirszcz
(Mixed) Integer Nonlinear Programming
Orbital shrinking
Matteo Fischetti, Leo Liberti
(Mixed) Integer Linear Programming
Mixed nStep MIR Inequalities: Facets for the nMixing Set
Sujeevraja Sanjeevi, Kiavash Kianfar
(Mixed) Integer Nonlinear Programming
More BranchandBound Experiments in Convex Nonlinear Integer Programming
Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter
October 2011
(Mixed) Integer Nonlinear Programming
Derivativefree methods for constrained mixedinteger optimization
Giampaolo Liuzzi, Stefano Lucidi, Francesco Rinaldi
(Mixed) Integer Linear Programming
How tight is the corner relaxation? Insights gained from the stable set problem
Gérard Cornuéjols, Carla Michini, Giacomo Nannicini
November 2011
Cutting Plane Approaches
The Triangle Closure is a Polyhedron
Amitabh Basu, Robert Hildebrand, Matthias Koeppe
(Mixed) Integer Linear Programming
On tbranch split cuts for mixedinteger programs
Sanjeeb Dash, Oktay Gunluk
(Mixed) Integer Nonlinear Programming
nstep Conic Mixed Integer Rounding Inequalities
Sina Masihabadi, Sujeevraja Sanjeevi, Kiavash Kianfar
December 2011
01 Programming
Using Symmetry to Optimize Over the SheraliAdams Relaxation
James Ostrowski
