-

 

 

 




Optimization Online





 

Integer Programming Submissions - 2011

January 2011

(Mixed) Integer Linear Programming
A Computational Study of Finitely Convergent Polyhedral Methods for General Mixed-Integer 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 mixed-integer techniques
Florin Stoican, Ionela Prodan, Sorin Olaru

(Mixed) Integer Nonlinear Programming
Reformulating mixed-integer 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 Mixed-Integer Bilinear Covering Sets
Kwanghun Chung, Jean-Philippe P. Richard, Mohit Tawarmalani

Cutting Plane Approaches
A Chance-Constrained 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 n-step MIR and Partition Inequalities for\\ Integer Knapsack and Single-node 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 two-row cuts
Quentin Louveaux, Laurent Poirrier

Branch-and-Cut for Separable Piecewise Linear Optimization: New Inequalities and Intersection with Semi-Continuous Constraints
Ming Zhao, Ismael de Farias

Branch-and-Cut 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 Cutting-Planes
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 Semi-Continuous Knapsack Problem
Ismael de Farias, Ming Zhao

(Mixed) Integer Nonlinear Programming
An Outer-Inner 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 multi-objective 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 Mixed-Integer 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 Lattice-Free 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átal-Gomory style operators
Sebastian Pokutta

(Mixed) Integer Nonlinear Programming
Unbounded Convex Sets for Non-Convex Mixed-Integer Quadratic Programming
Samuel Burer, Adam Letchford

Cutting Plane Approaches
A (k+1)-Slope Theorem for the k-Dimensional Infinite Group Relaxation
Amitabh Basu, Robert Hildebrand, Matthias Koeppe, Marco Molinaro

Lattice-free sets, branching disjunctions, and mixed-integer 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 n-Step MIR Inequalities: Facets for the n-Mixing Set
Sujeevraja Sanjeevi, Kiavash Kianfar

(Mixed) Integer Nonlinear Programming
More Branch-and-Bound Experiments in Convex Nonlinear Integer Programming
Pierre Bonami, Jon Lee, Sven Leyffer, Andreas Wächter


October 2011

(Mixed) Integer Nonlinear Programming
Derivative-free methods for constrained mixed-integer 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 t-branch split cuts for mixed-integer programs
Sanjeeb Dash, Oktay Gunluk

(Mixed) Integer Nonlinear Programming
n-step Conic Mixed Integer Rounding Inequalities
Sina Masihabadi, Sujeevraja Sanjeevi, Kiavash Kianfar


December 2011

0-1 Programming
Using Symmetry to Optimize Over the Sherali-Adams Relaxation
James Ostrowski


  Visitors Authors More about us Links
  Subscribe, Unsubscribe
Digest Archive
Search, Browse the Repository

 

Submit
Update
Policies
Coordinator's Board
Classification Scheme
Credits
Give us feedback
Optimization Journals, Sites, Societies
Mathematical Programming Society