LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428)
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: LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions |
scientific article; zbMATH DE number 1140458
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions |
scientific article; zbMATH DE number 1140458 |
Statements
LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (English)
0 references
13 April 1998
0 references
convexification
0 references
multicommodity network optimization
0 references
lower bounds
0 references
discontinuous step increasing cost functions
0 references
0.8991228
0 references
0.89006454
0 references
0 references
0.88570184
0 references
0.88298094
0 references
0.8640189
0 references
0.85536516
0 references
0.84711105
0 references
