Pages that link to "Item:Q2164691"
From MaRDI portal
The following pages link to On the complexity of separation from the knapsack polytope (Q2164691):
Displaying 5 items.
- On the complexity of the separation problem for rounded capacity inequalities (Q1751233) (← links)
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems (Q2914297) (← links)
- Easily Computable Facets of the Knapsack Polytope (Q3032082) (← links)
- New classes of facets for complementarity knapsack problems (Q6585265) (← links)
- On the complexity of separating cutting planes for the knapsack polytope (Q6589743) (← links)