"A polynomial time primal network simplex algorithm for minimum cost flows."

James B. Orlin (1997)

> Home

Details and statistics

DOI: 10.1007/BF02614365

access: closed

type: Journal Article

metadata version: 2018-11-14

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/mp/Orlin97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/mp/Orlin97
James B. Orlin:
A polynomial time primal network simplex algorithm for minimum cost flows. Math. Program. 77: 109-129 (1997)

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.