Approximating reduced costs under degeneracy in a network flow problem with side constraints (Q5689761)
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: Approximating reduced costs under degeneracy in a network flow problem with side constraints |
scientific article; zbMATH DE number 961879
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Approximating reduced costs under degeneracy in a network flow problem with side constraints |
scientific article; zbMATH DE number 961879 |
Statements
7 January 1997
0 references
optimal simplex tableau
0 references
degeneracy
0 references
network flow problems with side constraints
0 references
Lagrangian relaxation
0 references
minimum-cost network flow algorithm
0 references
shortest path algorithm
0 references
Approximating reduced costs under degeneracy in a network flow problem with side constraints (English)
0 references
