Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

IPCO
2004

favoriteEmaildiscussreport

93views Optimization» more IPCO 2004»

Semi-continuous Cuts for Mixed-Integer Programming

13 years 6 months ago

Semi-continuous Cuts for Mixed-Integer Programming

Download www.optimization-online.org

We study the convex hull of the feasible set of the semi-continuous knapsack problem, in which the variables belong to the union of two intervals. Besides being important in its own right, the semi-continuous knapsack problem is a relaxation of general mixed-integer programming. We show how strong inequalities valid for the semi-continuous knapsack polyhedron can be derived and used in a branch-and-cut scheme for mixed-integer programming and problems with semi-continuous variables. We present computational results that demonstrate the e

I. R. de Farias

Real-time Traffic

IPCO 2004 | IPCO 2007 | Semi-continuous | Semi-continuous Knapsack | Semi-continuous Knapsack Problem |

claim paper

Related Content

» Finite Disjunctive Programming Characterizations for General MixedInteger Linear Programs

» MixedInteger Cuts from Cyclic Groups

» Cutting planes in integer and mixed integer programming

» TwoStep MIR Inequalities for Mixed Integer Programs

» Cuts for Conic MixedInteger Programming

» General Mixed Integer Programming Computational Issues for BranchandCut Algorithms

» On the Exact Separation of Mixed Integer Knapsack Cuts

» Combinatorial Benders Cuts for MixedInteger Linear Programming

» A decompositionbased solution method for stochastic mixed integer nonlinear programs

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2004
Where	IPCO
Authors	I. R. de Farias

Comments (0)