An O(nm)-time network simplex algorithm for the shortest path problem
- Author
- GOLDFARB, D1 ; ZHIYING JIN2
[1] Columbia University, New York, New York, United States
[2] GTE Laboratories, Inc., Waltham, Massachusetts, United States - Source
Operations research. 1999, Vol 47, Num 3, pp 445-448 ; ref : 12 ref
- CODEN
- OPREAI
- ISSN
- 0030-364X
- Scientific domain
- Control theory, operational research
- Publisher
- Institute for Operations Research and the Management Sciences, Linthicum, MD
- Publication country
- United States
- Document type
- Article
- Language
- English
- Keyword (fr)
- Algorithme parallèle Algorithme rapide Algorithme Implémentation Méthode simplexe Plus court chemin Programmation linéaire Réseau
- Keyword (en)
- Parallel algorithm Fast algorithm Algorithm Implementation Simplex method Shortest path Linear programming Network
- Keyword (es)
- Algoritmo paralelo Algoritmo rápido Algoritmo Ejecución Método simplejo Camino más corto Programación lineal Red
- Classification
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A03 Mathematical programming
- Pascal
- 001 Exact sciences and technology / 001D Applied sciences / 001D01 Operational research. Management science / 001D01A Operational research and scientific management / 001D01A04 Flows in networks. Combinatorial problems
- Discipline
- Operational research. Management
- Origin
- Inist-CNRS
- Database
- PASCAL
- INIST identifier
- 1952094
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Access to the document
Install on your browser
DOI
10.1287/opre.47.3.445 
https://dx.doi.org/10.1287/opre.47.3.445
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Operations research\";s:9:\"\u0000*\u0000stitle\";s:9:\"Oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"445\";s:8:\"\u0000*\u0000epage\";s:3:\"448\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0030-364X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"GOLDFARB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"ZHIYING JIN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OPREAI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Panist access
"O:12:\"IstexOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Operations research\";s:9:\"\u0000*\u0000stitle\";s:9:\"Oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"445\";s:8:\"\u0000*\u0000epage\";s:3:\"448\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0030-364X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"GOLDFARB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"ZHIYING JIN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OPREAI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Istex access
"O:16:\"UnpaywallOpenUrl\":35:{s:8:\"\u0000*\u0000email\";s:27:\"assistance-portail@inist.fr\";s:6:\"\u0000*\u0000fmt\";N;s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";N;s:7:\"\u0000*\u0000pmid\";N;s:9:\"\u0000*\u0000atitle\";N;s:9:\"\u0000*\u0000jtitle\";N;s:9:\"\u0000*\u0000stitle\";N;s:7:\"\u0000*\u0000date\";N;s:9:\"\u0000*\u0000volume\";N;s:8:\"\u0000*\u0000issue\";N;s:8:\"\u0000*\u0000spage\";N;s:8:\"\u0000*\u0000epage\";N;s:8:\"\u0000*\u0000pages\";N;s:7:\"\u0000*\u0000issn\";N;s:8:\"\u0000*\u0000eissn\";N;s:9:\"\u0000*\u0000aulast\";N;s:10:\"\u0000*\u0000aufirst\";N;s:9:\"\u0000*\u0000auinit\";N;s:10:\"\u0000*\u0000auinitm\";N;s:5:\"\u0000*\u0000au\";N;s:9:\"\u0000*\u0000aucorp\";N;s:7:\"\u0000*\u0000isbn\";N;s:8:\"\u0000*\u0000coden\";N;s:8:\"\u0000*\u0000genre\";N;s:7:\"\u0000*\u0000part\";N;s:9:\"\u0000*\u0000btitle\";N;s:8:\"\u0000*\u0000title\";N;s:8:\"\u0000*\u0000place\";N;s:6:\"\u0000*\u0000pub\";N;s:10:\"\u0000*\u0000edition\";N;s:9:\"\u0000*\u0000tpages\";N;s:9:\"\u0000*\u0000series\";N;s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";N;}"
Unpaywall access
"O:16:\"EuropePMCOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Operations research\";s:9:\"\u0000*\u0000stitle\";s:9:\"Oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"445\";s:8:\"\u0000*\u0000epage\";s:3:\"448\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0030-364X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"GOLDFARB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"ZHIYING JIN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OPREAI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Europe PubMed Central access
"O:11:\"BaseOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Operations research\";s:9:\"\u0000*\u0000stitle\";s:9:\"Oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"445\";s:8:\"\u0000*\u0000epage\";s:3:\"448\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0030-364X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"GOLDFARB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"ZHIYING JIN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OPREAI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
Base Search access
"O:12:\"ArXivOpenUrl\":35:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000fmt\";s:7:\"journal\";s:6:\"\u0000*\u0000doi\";s:21:\"10.1287\/opre.47.3.445\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:9:\"\u0000*\u0000jtitle\";s:19:\"Operations research\";s:9:\"\u0000*\u0000stitle\";s:9:\"Oper. res\";s:7:\"\u0000*\u0000date\";s:4:\"1999\";s:9:\"\u0000*\u0000volume\";s:2:\"47\";s:8:\"\u0000*\u0000issue\";s:1:\"3\";s:8:\"\u0000*\u0000spage\";s:3:\"445\";s:8:\"\u0000*\u0000epage\";s:3:\"448\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0030-364X\";s:8:\"\u0000*\u0000eissn\";s:0:\"\";s:9:\"\u0000*\u0000aulast\";s:8:\"GOLDFARB\";s:10:\"\u0000*\u0000aufirst\";s:1:\"D\";s:9:\"\u0000*\u0000auinit\";s:0:\"\";s:10:\"\u0000*\u0000auinitm\";s:0:\"\";s:5:\"\u0000*\u0000au\";a:1:{i:0;s:11:\"ZHIYING JIN\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"OPREAI\";s:8:\"\u0000*\u0000genre\";s:7:\"article\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:0:\"\";s:8:\"\u0000*\u0000title\";s:69:\"An O(nm)-time network simplex algorithm for the shortest path problem\";s:8:\"\u0000*\u0000place\";s:13:\"Linthicum, MD\";s:6:\"\u0000*\u0000pub\";s:61:\"Institute for Operations Research and the Management Sciences\";s:10:\"\u0000*\u0000edition\";s:0:\"\";s:9:\"\u0000*\u0000tpages\";s:0:\"\";s:9:\"\u0000*\u0000series\";s:0:\"\";s:8:\"\u0000*\u0000proxy\";s:30:\"http:\/\/proxyout.inist.fr:8080\/\";s:12:\"\u0000*\u0000integrite\";b:1;}"
arXiv access
