The following pages link to The Sequential Knapsack Polytope (Q4389190):
Displayed 10 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Compact formulations as a union of polyhedra (Q927156) (← links)
- A polynomial algorithm for the multiple knapsack problem with divisible item sizes (Q987829) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Lexicographical order in integer programming (Q2405486) (← links)
- A new upper bound for the multiple knapsack problem (Q2668625) (← links)
- The Mixing Set with Divisible Capacities (Q3503864) (← links)