"New polynomial-time cycle-canceling algorithms for minimum-cost flows."

P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin (2000)

> Home

Details and statistics

DOI: 10.1002/1097-0037(200008)36:1<53::AID-NET6>3.0.CO;2-Y

access: closed

type: Journal Article

metadata version: 2017-05-28

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/SokkalingamAO00
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/SokkalingamAO00
P. T. Sokkalingam, Ravindra K. Ahuja, James B. Orlin:
New polynomial-time cycle-canceling algorithms for minimum-cost flows. Networks 36(1): 53-63 (2000)

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.