"A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network ..."

Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin (2004)

> Home

Details and statistics

DOI: 10.1007/S00453-004-1085-2

access: closed

type: Journal Article

metadata version: 2019-06-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/algorithmica/AhujaHO04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/algorithmica/AhujaHO04
Ravindra K. Ahuja, Dorit S. Hochbaum, James B. Orlin:
A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem. Algorithmica 39(3): 189-208 (2004)

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.