A comparison of algorithms for one class of totally regular truncations

zbMATH Open0962.90025MaRDI QIDQ2713880

A. L. Evstifeeva

Publication date: 10 June 2001

zbMATH Keywords

integer programmingcutting algorithm

Mathematics Subject Classification ID

Special polytopes (linear programming, centrally symmetric, etc.) (52B12) Integer programming (90C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

This page was built for publication: A comparison of algorithms for one class of totally regular truncations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2713880)