A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem
Saved in:
| Published in | Algorithmica Vol. 39; no. 3; pp. 189 - 208 |
|---|---|
| Main Authors | , , |
| Format | Journal Article |
| Language | English |
| Published |
New York, NY
Springer
01.07.2004
|
| Subjects | |
| Online Access | Get full text |
| ISSN | 0178-4617 1432-0541 |
| DOI | 10.1007/s00453-004-1085-2 |
Cover
| ISSN: | 0178-4617 1432-0541 |
|---|---|
| DOI: | 10.1007/s00453-004-1085-2 |