Pages that link to "Item:Q1197887"
From MaRDI portal
The following pages link to A characterization of knapsacks with the max-flow--min-cut property (Q1197887):
Displaying 11 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- Binary extended formulations of polyhedral mixed-integer sets (Q1650775) (← links)
- Lexicographical polytopes (Q1707907) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
- Reliability, covering and balanced matrices (Q1892656) (← links)
- Strong IP formulations need large coefficients (Q2019425) (← links)
- Multi-cover inequalities for totally-ordered multiple knapsack sets: theory and computation (Q2689829) (← links)