Combinatorial separation algorithms of complexity O(nm + m log m) are presented for the continuous knapsack polyhedra with divisible capacities; complemented partition inequalities are introduced that dominate the prior <=-partition inequalities and fully describe the <= polyhedron.
Mathematical Progra mming 60(1-3):233–250
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2019 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Combinatorial separation algorithms for the continuous knapsack polyhedra with divisible capacities
Combinatorial separation algorithms of complexity O(nm + m log m) are presented for the continuous knapsack polyhedra with divisible capacities; complemented partition inequalities are introduced that dominate the prior <=-partition inequalities and fully describe the <= polyhedron.