A comparison of algorithms for one class of totally regular truncations

MaRDI QIDQ2713880zbMATH OpenFDO

Authors A. L. Evstifeeva

Publication date 10 June 2001

zbMATH Keywords

cutting algorithminteger programming

Mathematics Subject Classification ID

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

Review text

Totally regular truncations on an integer lattice are studied, which are suitable for a wide class of problems of integer programming. The author investigates algorithms obtained as modifications of results by \textit{O.~Zablotskaya} [Upr. Sist. 25, 68-74 (1984; Zbl 0607.90059)] and \textit{R.~Simanchev} [Upr. Sist. 30, 61-71 (1990; Zbl 0814.90091)].NEWLINENEWLINEFor the entire collection see [Zbl 0935.00013].

Recommendations

• scientific article; zbMATH DE number 706874
• scientific article; zbMATH DE number 3952496
• scientific article; zbMATH DE number 3982913
• scientific article; zbMATH DE number 808805
• Truncated Gröbner bases for integer programming

Cited in

(3)

• scientific article; zbMATH DE number 3952496 (Why is no real title available?)
• scientific article; zbMATH DE number 3982913 (Why is no real title available?)
• scientific article; zbMATH DE number 706874 (Why is no real title available?)

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)