Sciweavers

8 search results - page 1 / 2
» Lifting for conic mixed-integer programming
Sort
View
IPCO
2007
140views Optimization» more  IPCO 2007»
14 years 10 days ago
Cuts for Conic Mixed-Integer Programming
A conic integer program is an integer programming problem with conic constraints. Conic integer programming has important applications in finance, engineering, statistical learnin...
Alper Atamtürk, Vishnu Narayanan
ANOR
2007
126views more  ANOR 2007»
13 years 11 months ago
Lifting, superadditivity, mixed integer rounding and single node flow sets revisited
In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer roun...
Quentin Louveaux, Laurence A. Wolsey
MP
2011
13 years 5 months ago
Lifting for conic mixed-integer programming
Lifting is a procedure for deriving valid inequalities for mixed-integer sets from valid inequalities for suitable restrictions of those sets. Lifting has been shown to be very e...
Alper Atamtürk, Vishnu Narayanan
MP
2010
128views more  MP 2010»
13 years 9 months ago
Perspective reformulations of mixed integer nonlinear programs with indicator variables
Abstract. We study mixed integer nonlinear programs (MINLP)s that are driven by a collection of indicator variables where each indicator variable controls a subset of the decision ...
Oktay Günlük, Jeff Linderoth
IPCO
2010
174views Optimization» more  IPCO 2010»
14 years 11 days ago
On Lifting Integer Variables in Minimal Inequalities
This paper contributes to the theory of cutting planes for mixed integer linear programs (MILPs). Minimal valid inequalities are well understood for a relaxation of an MILP in tab...
Amitabh Basu, Manoel B. Campêlo, Michele Con...