Valid inequalities for mixed 0-1 programs

DOI10.1016/0166-218X(86)90061-2zbMath0593.90058OpenAlexW2137972592MaRDI QIDQ1076609

Publication date: 1986

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0166-218x(86)90061-2

zbMATH Keywords

convex hull facets mixed 0-1 programs multiple choice constraints valid linear inequalities most violated inequality parametric equality knapsack problems

Mathematics Subject Classification ID

Mixed integer programming (90C11)

Related Items

Knapsack polytopes: a survey, The application of valid inequalities to the multi-stage lot-sizing problem, Lifted Euclidean inequalities for the integer single node flow set with upper bounds, Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints, Valid Inequalities for Separable Concave Constraints with Indicator Variables, Theoretical challenges towards cutting-plane selection, The green capacitated multi-item lot sizing problem with parallel machines, A deterministic method for the unit commitment problem in power systems, The complementary class of generalized flow cover inequalities, Submodularity and valid inequalities in capacitated fixed charge networks, Strong formulations for mixed integer programming: A survey, Valid inequalities for mixed-integer programmes with fixed charges on sets of variables, Relating single-scenario facets to the convex hull of the extensive form of a stochastic single-node flow polytope, Sequence independent lifting of cover inequalities, Sequence independent lifting for mixed knapsack problems with GUB constraints, Path Cover and Path Pack Inequalities for the Capacitated Fixed-Charge Network Flow Problem, Supermodularity and valid inequalities for quadratic optimization with indicators, LS-LIB: A Library of Tools for Solving Production Planning Problems, An exact algorithm for the identical parallel machine scheduling problem., A polyhedral study of lot-sizing with supplier selection, Network Models with Unsplittable Node Flows with Application to Unit Train Scheduling, Valid inequalities and separation for capacitated fixed charge flow problems, Linear complementarity problems solvable by integer programming, A multi-stop routing problem, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Nonconvex, lower semicontinuous piecewise linear optimization, Cutting planes in integer and mixed integer programming, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Convex hull results for generalizations of the constant capacity single node flow set, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Unnamed Item, SCIP: solving constraint integer programs, Valid inequalities for separable concave constraints with indicator variables, New valid inequalities for the fixed-charge and single-node flow polytopes, Generalizing 0-1 conflict hypergraphs and mixed conflict graphs: mixed conflict hypergraphs in discrete optimization, On the structure of linear programs with overlapping cardinality constraints, On cut-based inequalities for capacitated network design polyhedra, Valid inequalities and facets of the capacitated plant location problem, Valid inequalities and separation for mixed 0-1 constraints with variable upper bounds, A cutting plane algorithm for the unrelated parallel machine scheduling problem, Polyhedral description of the integer single node flow set with constant bounds, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds, Logic-based modeling and solution of nonlinear discrete/continuous optimization problems

Cites Work