28 search results - page 2 / 6 » Semi-continuous Cuts for Mixed-Integer Programming |
CCO
2001
Springer
13 years 9 months ago
2001
Springer
In this paper we survey the basic features of state-of-the-art branch-and-cut algorithms for the solution of general mixed integer programming problems. In particular we focus on p...
IPCO
2007
13 years 6 months ago
2007
During the last decades, much research has been conducted deriving classes of valid inequalities for single-row mixed integer programming polyhedrons. However, no such class has ha...
IOR
2006
13 years 4 months ago
2006
Mixed-Integer Programs (MIP's) involving logical implications modelled through big-M coefficients, are notoriously among the hardest to solve. In this paper we propose and an...
IPCO
2004
13 years 6 months ago
2004
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 o...
4OR
2006
13 years 4 months ago
2006
This is a summary of the main results presented in the author's PhD thesis, supervised by D. Conforti and P. Beraldi and defended on March 2005. The thesis, written in English...