The following pages link to On the \(0/1\) knapsack polytope (Q1373759):
Displaying 50 items.
- A polyhedral study on \(0\)-\(1\) knapsack problems with disjoint cardinality constraints: facet-defining inequalities by sequential lifting (Q429688) (← links)
- On the transportation problem with market choice (Q479018) (← links)
- Progress in computational mixed integer programming -- a look back from the other side of the tipping point (Q537580) (← links)
- Generalized coefficient strengthening cuts for mixed integer programming (Q683740) (← links)
- Recoverable robust knapsacks: the discrete scenario case (Q691430) (← links)
- Cutting planes in integer and mixed integer programming (Q697578) (← links)
- The M{\texttt{CF}}-separator: Detecting and exploiting multi-commodity flow structures in MIPs (Q708779) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- The quadratic knapsack problem -- a survey (Q875597) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Simultaneously lifting sets of binary variables into cover inequalities for knapsack polytopes (Q951099) (← links)
- Cutting planes for integer programs with general integer variables (Q1290616) (← links)
- On using an automatic scheme for obtaining the convex hull defining inequalities of a Weismantel 0-1 knapsack constraint (Q1304779) (← links)
- On facets of knapsack equality polytopes (Q1367796) (← links)
- Complete description of a class of knapsack polytopes. (Q1400340) (← links)
- On the facets of the mixed-integer knapsack polyhedron (Q1424283) (← links)
- Theoretical challenges towards cutting-plane selection (Q1650776) (← links)
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem (Q1742898) (← links)
- Where are the hard knapsack problems? (Q1772862) (← links)
- Aggregation-based cutting-planes for packing and covering integer programs (Q1785202) (← 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)
- An \(O(n \log n)\) procedure for identifying facets of the knapsack polytope. (Q1811629) (← links)
- A cut-and-solve based algorithm for the single-source capacitated facility location problem (Q1926885) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets (Q2061876) (← links)
- Face dimensions of general-purpose cutting planes for mixed-integer linear programs (Q2061900) (← links)
- On the complexity of separation from the knapsack polytope (Q2164691) (← links)
- New valid inequalities for the fixed-charge and single-node flow polytopes (Q2294335) (← links)
- LP and SDP branch-and-cut algorithms for the minimum graph bisection problem: a computational comparison (Q2392866) (← links)
- A note on the extension complexity of the knapsack polytope (Q2450664) (← links)
- Polyhedral properties for the intersection of two knapsacks (Q2476986) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- Lifting the knapsack cover inequalities for the knapsack polytope (Q2661529) (← links)
- A cut-and-branch algorithm for the quadratic knapsack problem (Q2673234) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)
- On the knapsack closure of 0-1 integer linear programs (Q2861491) (← links)
- Integrality Gaps of Linear and Semi-Definite Programming Relaxations for Knapsack (Q3009771) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- A branch-and-cut algorithm for the undirected prize collecting traveling salesman problem (Q3057103) (← links)
- A Comparative Study of Linear and Semidefinite Branch-and-Cut Methods for Solving the Minimum Graph Bisection Problem (Q3503843) (← links)
- (Q3840363) (← links)
- Hilbert Bases and the Facets of Special Knapsack Polytopes (Q4332256) (← links)
- Quadratic knapsack relaxations using cutting planes and semidefinite programming (Q4645922) (← links)
- (Q4866688) (← links)
- Discrete relaxations of combinatorial programs (Q5946814) (← links)
- Lifting for the integer knapsack cover polyhedron (Q6102182) (← links)
- Improving the scheduling of railway maintenance projects by minimizing passenger delays subject to event requests of railway operators (Q6561224) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)
