Valid inequalities and cutting planes for some polytopes

DOI10.7153/MIA-01-28zbMath0903.90138OpenAlexW2322564035MaRDI QIDQ4392322

Stefan M. Stefanov

Publication date: 8 June 1998

Published in: Mathematical Inequalities & Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7153/mia-01-28

zbMATH Keywords

cutting planesmultidimensional knapsack polytopevalid and dominating inequalities

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Combinatorial optimization (90C27)

Related Items (1)

On the solution of multidimensional convex separable continuous knapsack problem with bounded variables

This page was built for publication: Valid inequalities and cutting planes for some polytopes