Pages that link to "Item:Q2639772"
From MaRDI portal
The following pages link to Valid inequalities for 0-1 knapsacks and MIPs with generalised upper bound constraints (Q2639772):
Displaying 27 items.
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: strong valid inequalities by sequence-independent lifting (Q429687) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Mixed integer programming: A historical perspective with Xpress-MP (Q537574) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- SCIP: solving constraint integer programs (Q734351) (← links)
- On a fix-and-relax framework for a class of project scheduling problems (Q817205) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On a stochastic sequencing and scheduling problem (Q875406) (← links)
- Sequence independent lifting for mixed knapsack problems with GUB constraints (Q896279) (← links)
- Strong valid inequalities for the resource-constrained scheduling problem with uniform resource requirements (Q924628) (← links)
- A time indexed formulation of non-preemptive single machine scheduling problems (Q1196724) (← links)
- MIP modelling of changeovers in production planning and scheduling problems (Q1278814) (← links)
- Valid inequalities for a class of assembly system problems (Q1584810) (← links)
- Accurate optimization models for interference constrained bandwidth allocation in cellular networks (Q1628035) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Changeover formulations for discrete-time mixed-integer programming scheduling models (Q1753514) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Two alternative models for farm management: Discrete versus continuous time horizon (Q1869414) (← links)
- Locating median cycles in networks (Q1887911) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- On the structure of linear programs with overlapping cardinality constraints (Q2297664) (← links)
- Disjunctive decomposition for two-stage stochastic mixed-binary programs with generalized upper bound constraints (Q2815438) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- On facet-inducing inequalities for combinatorial polytopes (Q5374012) (← links)
- Lifting, superadditivity, mixed integer rounding and single node flow sets revisited (Q5920488) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)
- A compact formulation for the base station deployment problem in wireless networks (Q6179723) (← links)
