Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming (Q1294550): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/s0168-9274(98)00103-2 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1992586141 / rank | |||
Normal rank | |||
Latest revision as of 10:58, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Complexity analysis of logarithmic barrier decomposition methods for semi-infinite linear programming |
scientific article |
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
