Pages that link to "Item:Q908302"
From MaRDI portal
The following pages link to Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302):
Displaying 13 items.
- Continuous knapsack sets with divisible capacities (Q263180) (← links)
- Convex hull characterizations of lexicographic orderings (Q330274) (← links)
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Knapsack polytopes: a survey (Q827125) (← links)
- Lexicographical polytopes (Q1707907) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Exact lexicographic scheduling and approximate rescheduling (Q2029366) (← links)
- Special issue: Global solution of integer, stochastic and nonconvex optimization problems (Q2097627) (← links)
- Matrices with lexicographically-ordered rows (Q2414107) (← links)
- Forbidden Vertices (Q5252224) (← links)
- A few strong knapsack facets (Q5351614) (← links)
- Scanning integer points with lex-inequalities: a finite cutting plane algorithm for integer programming with linear objective (Q6057717) (← links)
- When greedy gives optimal: a unified approach (Q6122087) (← links)
