"A dual simplex algorithm for finding all shortest paths."

Michael Florian, Sang Nguyen, Stefano Pallottino (1981)

> Home

Details and statistics

DOI: 10.1002/NET.3230110406

access: closed

type: Journal Article

metadata version: 2020-07-17

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/networks/FlorianNP81
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/FlorianNP81
Michael Florian, Sang Nguyen, Stefano Pallottino:
A dual simplex algorithm for finding all shortest paths. Networks 11(4): 367-378 (1981)

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.