Valid Inequalities and Superadditivity for 0–1 Integer Programs
From MaRDI portal
Publication:4187583
DOI10.1287/moor.2.1.66zbMath0402.90066OpenAlexW2007126271MaRDI QIDQ4187583
Publication date: 1977
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2.1.66
Related Items
Knapsack polytopes: a survey, Cutting planes for the multistage stochastic unit commitment problem, Lifting inequalities: a framework for generating strong cuts for nonlinear programs, Lifting two-integer knapsack inequalities, Lifting the knapsack cover inequalities for the knapsack polytope, Sequence independent lifting of cover inequalities, Lifting for the integer knapsack cover polyhedron, Lifting for conic mixed-integer programming, Sequence independent lifting for mixed knapsack problems with GUB constraints, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, The generalized assignment problem: Valid inequalities and facets, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Generalized cover facet inequalities for the generalized assignment problem, On the minimum cost multiple-source unsplittable flow problem, The multi-item capacitated lot-sizing problem with setup times and shortage costs, Approximate and exact merging of knapsack constraints with cover inequalities, Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes, Maximizing a class of submodular utility functions with constraints, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Lifted inequalities for \(0-1\) mixed-integer bilinear covering sets, A mixed integer linear programming approach to minimize the number of late jobs with and without machine availability constraints, Cutting planes in integer and mixed integer programming, Maximizing a class of submodular utility functions, The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs, Flow pack facets of the single node fixed-charge flow polytope, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, Lifting convex inequalities for bipartite bilinear programs, On lifted cover inequalities: a new lifting procedure with unusual properties, Lifting convex inequalities for bipartite bilinear programs, Valid inequalities for mips and group polyhedra from approximate liftings, On the capacitated lot-sizing and continuous 0-1 knapsack polyhedra, Sequence independent lifting for a set of submodular maximization problems, Sequence independent lifting for mixed integer programs with variable upper bounds, Lifting for mixed integer programs with variable upper bounds, Cover and pack inequalities for (mixed) integer programming
