A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (Q1376264)
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 fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball |
scientific article; zbMATH DE number 1097567
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball |
scientific article; zbMATH DE number 1097567 |
Statements
A fully polynomial epsilon approximation cutting plane algorithm for solving combinatorial linear programs containing a sufficiently large ball (English)
0 references
17 December 1997
0 references
cutting plane algorithm
0 references
\(\varepsilon\)-approximate solutions
0 references
0 references
0.8543369174003601
0 references
0.7585230469703674
0 references
0.7563705444335938
0 references
0.7537695169448853
0 references
0.752911388874054
0 references
