Tightening simple mixed-integer sets with guaranteed bounds
نویسندگان
چکیده
منابع مشابه
Tightening simple mixed-integer sets with guaranteed bounds
In this paper we consider 0/1 knapsack sets and certain simple fixed-charge network flow sets. The study of such sets is relevant in that a popular approach for solving general mixed-integer programs consists of selecting a subset of constraints with particular structure (such as a single-node fixedcharge flow problem) and tightening that part of the formulation through the use, for example, of...
متن کاملValid Inequalities Based on Simple Mixed-Integer Sets
In this paper we use facets of simple mixed-integer sets with three variables to derive a parametric family of valid inequalities for general mixed-integer sets. We call these inequalities two-step MIR inequalities as they can be derived by applying the simple mixed-integer rounding (MIR) principle of Wolsey (1998) twice. The two-step MIR inequalities define facets of the master cyclic group po...
متن کاملMingling: mixed-integer rounding with bounds
Mixed-integer rounding (MIR) is a simple, yet powerful procedure for generating valid inequalities for mixed-integer programs. When used as cutting planes, MIR inequalities are very effective for mixed-integer programming problems with unbounded integer variables. For problems with bounded integer variables, however, cutting planes based on lifting techniques appear to be more effective. This i...
متن کاملOn mixed-integer sets with two integer variables
We show that every facet-defining inequality of the convex hull of a mixed-integer polyhedral set with two integer variables is a crooked cross cut (which we defined in 2010). We extend this result to show that crooked cross cuts give the convex hull of mixed-integer sets with more integer variables if the coefficients of the integer variables form a matrix of rank 2. We also present an alterna...
متن کاملOn a class of mixed-integer sets with a single integer variable
We consider mixed-integer sets defined by a linear system Ax ≥ b plus an integrality requirement on one variable, where A is a totally unimodular matrix with at most two nonzero entries per row. We give a complete linear-inequality description for the convex hull of any set of this type.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical Programming
سال: 2010
ISSN: 0025-5610,1436-4646
DOI: 10.1007/s10107-010-0435-x