On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs (Q4895628)
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: Publication:4895628 |
scientific article; zbMATH DE number 935282
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs |
scientific article; zbMATH DE number 935282 |
Statements
On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs (English)
0 references
14 October 1996
0 references
cutting plane algorithm
0 references
combinatorial linear programs
0 references
separation oracle
0 references
0.8543369174003601
0 references
0.7948287725448608
0 references
0.793378472328186
0 references
0.7884209752082825
0 references
