On the description of a class of integer programs resolvable by the coordinate lift algorithm (Q2773681)
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: On the description of a class of integer programs resolvable by the coordinate lift algorithm |
scientific article; zbMATH DE number 1710298
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the description of a class of integer programs resolvable by the coordinate lift algorithm |
scientific article; zbMATH DE number 1710298 |
Statements
24 February 2002
0 references
greedy algorithm
0 references
integer programming
0 references
parallel and successive networks
0 references
On the description of a class of integer programs resolvable by the coordinate lift algorithm (English)
0 references
A class of integer programs resolvable by the coordinate lift (greedy) algorithm is analyzed. An arbitrary instance of this class is defined by a suitable integer matrix which satisfies a certain algebraic condition established by the author in [Upr. Sist. 17, 52--59 (1978; Zbl 0476.90046)]. The main result gives a complete characterization of the matrices considered in terms of parallel and successive networks.
0 references
