Pages that link to "Item:Q3032082"
From MaRDI portal
The following pages link to Easily Computable Facets of the Knapsack Polytope (Q3032082):
Displaying 40 items.
- Implicit cover inequalities (Q266036) (← links)
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- On the complexity of sequentially lifting cover inequalities for the knapsack polytope (Q829120) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Higher-order cover cuts from zero-one knapsack constraints augmented by two-sided bounding inequalities (Q951101) (← links)
- \(O(n \log n)\) procedures for tightening cover inequalities (Q1124826) (← links)
- Adjacency of the 0-1 knapsack problem (Q1195107) (← links)
- On tightening cover induced inequalities (Q1199516) (← links)
- The complexity of lifted inequalities for the knapsack problem (Q1201098) (← links)
- Polyhedral results for the precedence-constrained knapsack problem (Q1208480) (← links)
- Order selection on a single machine with high set-up costs (Q1309884) (← links)
- Unrelated machine scheduling with time-window and machine downtime constraints: An application to a naval battle-group problem (Q1339135) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- Lifted inequalities for 0-1 mixed integer programming: Basic theory and algorithms (Q1424281) (← links)
- A polyhedral study on chance constrained program with random right-hand side (Q1683680) (← links)
- Lifting of probabilistic cover inequalities (Q1728321) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- Optimization algorithms for the disjunctively constrained knapsack problem (Q1797814) (← links)
- Efficient reformulation for 0-1 programs -- methods and computational results (Q1803672) (← links)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- Lifted cover facets of the 0-1 knapsack polytope with GUB constraints (Q1890949) (← links)
- Valid inequalities and facets for a hypergraph model of the nonlinear knapsack and the FMS part selection problems (Q1904710) (← links)
- A combinatorial cut-and-lift procedure with an application to 0-1 second-order conic programming (Q2097632) (← links)
- The Minkowski sum of simplices in 3-dimensional space. An analytical description (Q2248741) (← links)
- On lifted cover inequalities: a new lifting procedure with unusual properties (Q2294273) (← links)
- Parametric convex quadratic relaxation of the quadratic knapsack problem (Q2329476) (← links)
- Local and global lifted cover inequalities for the 0-1 multidimensional knapsack problem (Q2462108) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- Cover inequalities for robust knapsack sets-Application to the robust bandwidth packing problem (Q2892146) (← links)
- Chance-Constrained Binary Packing Problems (Q2940063) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Chance-Constrained Multiple Bin Packing Problem with an Application to Operating Room Planning (Q5084621) (← links)
- Approximate and exact merging of knapsack constraints with cover inequalities (Q5151546) (← links)
- The aggregate capacity of virtual resources – linear models (Q5169447) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- A new sequential lifting of robust cover inequalities (Q6492454) (← links)
- Two-set inequalities for the binary knapsack polyhedra (Q6670502) (← links)
