Pages that link to "Item:Q4332256"
From MaRDI portal
The following pages link to Hilbert Bases and the Facets of Special Knapsack Polytopes (Q4332256):
Displaying 11 items.
- Cover and pack inequalities for (mixed) integer programming (Q817174) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lifting two-integer knapsack inequalities (Q868448) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Intermediate integer programming representations using value disjunctions (Q951104) (← links)
- The height of minimal Hilbert bases (Q1378894) (← links)
- Complete description of a class of knapsack polytopes. (Q1400340) (← links)
- Valid inequalities for the multi-dimensional multiple-choice 0-1 knapsack problem (Q1751116) (← links)
- Description of 2-integer continuous knapsack polyhedra (Q2506817) (← links)
- Coarse-grained entanglement classification through orthogonal arrays (Q4583103) (← links)
- Test sets and inequalities for integer programs (Q4645910) (← links)
