Contributions to General Mixed Integer Knapsack Problems
نویسندگان
چکیده
This paper deals with a general mixed integer knapsack polyhedron for which we introduce and analyze a new family of inequalities. We discuss the value of this family both from a theoretic and a computational point of view.
منابع مشابه
Solving zero-one mixed integer programming problems using tabu search
We describe a tabu search (TS) approach for solving general zero-one mixed integer programming (MIP) problems that exploits the extreme point property of zero-one solutions. Specialized choice rules and aspiration criteria are identified for the problems, expressed as functions of integer infeasibility measures and objective function values. The first-level TS mechanisms are then extended with ...
متن کاملProbabilistic programming with discrete distributions and precedence constrained knapsack polyhedra
We consider stochastic programming problems with probabilistic constraints in volving random variables with discrete distributions They can be reformulated as large scale mixed integer programming problems with knapsack constraints Using speci c properties of stochastic programming problems and bounds on the prob ability of the union of events we develop new inequalities for these mixed integer...
متن کاملOn the Exact Separation of Mixed Integer Knapsack Cuts
During the last decades, much research has been conducted on deriving classes of valid inequalities for mixed integer knapsack sets, which we call knapsack cuts. Bixby et al. (The sharpest cut: the impact of Manfred Padberg and his work. MPS/SIAM Series on Optimization, pp. 309–326, 2004) empirically observe that, within the context of branch-and-cut algorithms to solve mixed integer programmin...
متن کاملComputational testing of exact mixed knapsack separation for MIP problems
In this paper we study an exact separation algorithm for mixed knapsack sets with the aim of evaluating its effectiveness in a cutting plane algorithm for Mixed-Integer Programming. First proposed by Boyd in the 90’s, exact knapsack separation has recently found renewed interest. In this paper we present a “lightweight” exact separation procedure for mixed knapsack sets and perform a computatio...
متن کاملSemi-continuous Cuts for Mixed-Integer Programming
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...
متن کامل