Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints
From MaRDI portal
Publication:2639772
DOI10.1016/0166-218X(90)90148-6zbMath0718.90067WikidataQ126819317 ScholiaQ126819317MaRDI QIDQ2639772
Publication date: 1990
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Related Items
Knapsack polytopes: a survey, Accurate optimization models for interference constrained bandwidth allocation in cellular networks, Locating median cycles in networks, Lifted cover facets of the 0-1 knapsack polytope with GUB constraints, On a stochastic sequencing and scheduling problem, Sequence independent lifting for mixed knapsack problems with GUB constraints, A compact formulation for the base station deployment problem in wireless networks, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting, A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting, On facet-inducing inequalities for combinatorial polytopes, Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements, Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack, A time indexed formulation of non-preemptive single machine scheduling problems, Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem, Changeover formulations for discrete-time mixed-integer programming scheduling models, Mixed integer programming: A historical perspective with Xpress-MP, Cutting planes in integer and mixed integer programming, Discrete relaxations of combinatorial programs, Lifting, superadditivity, mixed integer rounding and single node flow sets revisited, A polyhedral study on 0-1 knapsack problems with set packing constraints, SCIP: solving constraint integer programs, On the structure of linear programs with overlapping cardinality constraints, Disjunctive Decomposition for Two-Stage Stochastic Mixed-Binary Programs with Generalized Upper Bound Constraints, MIP modelling of changeovers in production planning and scheduling problems, Valid inequalities for a class of assembly system problems, Two alternative models for farm management: Discrete versus continuous time horizon, On a fix-and-relax framework for a class of project scheduling problems
Cites Work
