LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions (Q1384428)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | LP relaxations better than convexification for multicommodity network optimization problems with step increasing cost functions |
scientific article |
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
