A strongly polynomial algorithm for bimodular integer linear programming (Q4978060)
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 strongly polynomial algorithm for bimodular integer linear programming |
scientific article; zbMATH DE number 6761891
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A strongly polynomial algorithm for bimodular integer linear programming |
scientific article; zbMATH DE number 6761891 |
Statements
A strongly polynomial algorithm for bimodular integer linear programming (English)
0 references
17 August 2017
0 references
integer programming
0 references
bounded subdeterminants
0 references
combinatorial optimization
0 references
total unimodularity
0 references
0.92157465
0 references
0.91962963
0 references
0.90676093
0 references
0.90653086
0 references
0.90263355
0 references
0.8960928
0 references
