Sciweavers

28 search results - page 1 / 6
» Semi-continuous Cuts for Mixed-Integer Programming
Sort
View
IOR
2011
133views more  IOR 2011»
12 years 11 months ago
Finite Disjunctive Programming Characterizations for General Mixed-Integer Linear Programs
In this paper, we give a finite disjunctive programming procedure to obtain the convex hull of general mixed-integer linear programs (MILP) with bounded integer variables. We prop...
Binyuan Chen, Simge Küçükyavuz, S...
MP
2007
100views more  MP 2007»
13 years 4 months ago
Mixed-Integer Cuts from Cyclic Groups
We analyze a separation procedure for Mixed-Integer Programs related to the work of Gomory and Johnson on interpolated subadditive functions. This approach has its roots in the Go...
Matteo Fischetti, Cristiano Saturni
DAM
2002
75views more  DAM 2002»
13 years 4 months ago
Cutting planes in integer and mixed integer programming
Hugues Marchand, Alexander Martin, Robert Weismant...
INFORMS
2010
100views more  INFORMS 2010»
13 years 1 months ago
Two-Step MIR Inequalities for Mixed Integer Programs
Two-step MIR inequalities are valid inequalities derived from a facet of a simple mixedinteger set with three variables and one constraint. In this paper we investigate how to eff...
Sanjeeb Dash, Marcos Goycoolea, Oktay Günl&uu...
IPCO
2007
140views Optimization» more  IPCO 2007»
13 years 6 months 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