A comparison of algorithms for one class of totally regular truncations (Q2713880)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A comparison of algorithms for one class of totally regular truncations |
scientific article; zbMATH DE number 1603147
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A comparison of algorithms for one class of totally regular truncations |
scientific article; zbMATH DE number 1603147 |
Statements
10 June 2001
0 references
cutting algorithm
0 references
integer programming
0 references
A comparison of algorithms for one class of totally regular truncations (English)
0 references
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].
0 references
0.6879553198814392
0 references
