Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550)
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: Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming |
scientific article; zbMATH DE number 1311301
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming |
scientific article; zbMATH DE number 1311301 |
Statements
Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (English)
0 references
27 November 2000
0 references
column generation
0 references
0 references
0 references
0 references
0.8681561350822449
0 references
0.8103473782539368
0 references
