Pages that link to "Item:Q4014772"
From MaRDI portal
The following pages link to A pseudopolynomial network flow formulation for exact knapsack separation (Q4014772):
Displaying 7 items.
- Knapsack polytopes: a survey (Q827125) (← links)
- Bidimensional packing by bilinear programming (Q1016113) (← links)
- Integer knapsack and flow covers with divisible coefficients: Polyhedra, optimization and separation (Q1804882) (← links)
- An exact separation algorithm for unsplittable flow capacitated network design arc-set polyhedron (Q2052386) (← links)
- Arc flow formulations based on dynamic programming: theoretical foundations and applications (Q2239929) (← links)
- Separation algorithms for 0-1 knapsack polytopes (Q2638369) (← links)
- (Q3835301) (← links)