On strongly polynomial dual simplex algorithms for the maximum flow problem
- Author
- GOLDFARB, D1 ; CHEN, W1
[1] Department of Industrial Engineering and Operations Research, Columbia University, New York, NY 10027, United States - Conference title
- Network optimization: Algorithms and applications
- Conference name
- Netflow93: International workshop on network optimization (San Miniato 1993-10-03)
- Author (monograph)
- GALLO, Giorgio (Editor)1 ; GRIGORIADIS, Michael D (Editor)2
Mathematical Programming Society (Funder/Sponsor)
Hewlett Packard Italy Ltd, Italy (Funder/Sponsor)
IBM SEMEA (Funder/Sponsor)
Italian Society of Operation Research, Italy (Funder/Sponsor)
Consiglio nationale delle ricerche, Roma, Italy (Funder/Sponsor)
Università di Pisa, Pisa, Italy (Funder/Sponsor)
[1] Università di Pisa, Pisa 56100, Italy
[2] Rutgers University, New Brunswick, NJ 08903, United States - Source
Mathematical programming. 1997, Vol 78, Num 2, pp 159-168 ; ref : 11 ref
- CODEN
- MHPGA4
- ISSN
- 0025-5610
- Scientific domain
- Control theory, operational research; Mathematics
- Publisher
- Springer, Heidelberg
- Publication country
- Germany
- Document type
- Conference Paper
- Language
- English
- Keyword (fr)
- Algorithme Dualité Flot optimal Flot réseau Méthode simplexe Optimisation Réseau Maximum flow Parametric maximum flow Preflow Strongly polynomial
- Keyword (en)
- Algorithms Duality Optimal flow Network flow Simplex method Optimization Network
- Keyword (es)
- Dualidad Flujo óptimo Flujo red Método simplejo Red
- Classification
- 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
- 2754808
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.1007/BF02614368 
https://dx.doi.org/10.1007/BF02614368
"O:13:\"PanistOpenUrl\":36:{s:10:\"\u0000*\u0000openUrl\";N;s:6:\"\u0000*\u0000idc\";N;s:6:\"\u0000*\u0000fmt\";s:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02614368\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:9:\"\u0000*\u0000jtitle\";s:24:\"Mathematical programming\";s:9:\"\u0000*\u0000stitle\";s:13:\"Math. program\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"78\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"159\";s:8:\"\u0000*\u0000epage\";s:3:\"168\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5610\";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:7:\"CHEN, W\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MHPGA4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:49:\"Network optimization: Algorithms and applications\";s:8:\"\u0000*\u0000title\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02614368\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:9:\"\u0000*\u0000jtitle\";s:24:\"Mathematical programming\";s:9:\"\u0000*\u0000stitle\";s:13:\"Math. program\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"78\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"159\";s:8:\"\u0000*\u0000epage\";s:3:\"168\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5610\";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:7:\"CHEN, W\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MHPGA4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:49:\"Network optimization: Algorithms and applications\";s:8:\"\u0000*\u0000title\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:18:\"10.1007\/BF02614368\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02614368\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:9:\"\u0000*\u0000jtitle\";s:24:\"Mathematical programming\";s:9:\"\u0000*\u0000stitle\";s:13:\"Math. program\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"78\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"159\";s:8:\"\u0000*\u0000epage\";s:3:\"168\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5610\";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:7:\"CHEN, W\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MHPGA4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:49:\"Network optimization: Algorithms and applications\";s:8:\"\u0000*\u0000title\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02614368\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:9:\"\u0000*\u0000jtitle\";s:24:\"Mathematical programming\";s:9:\"\u0000*\u0000stitle\";s:13:\"Math. program\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"78\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"159\";s:8:\"\u0000*\u0000epage\";s:3:\"168\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5610\";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:7:\"CHEN, W\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MHPGA4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:49:\"Network optimization: Algorithms and applications\";s:8:\"\u0000*\u0000title\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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:10:\"proceeding\";s:6:\"\u0000*\u0000doi\";s:18:\"10.1007\/BF02614368\";s:6:\"\u0000*\u0000pii\";s:0:\"\";s:7:\"\u0000*\u0000pmid\";s:0:\"\";s:9:\"\u0000*\u0000atitle\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:9:\"\u0000*\u0000jtitle\";s:24:\"Mathematical programming\";s:9:\"\u0000*\u0000stitle\";s:13:\"Math. program\";s:7:\"\u0000*\u0000date\";s:4:\"1997\";s:9:\"\u0000*\u0000volume\";s:2:\"78\";s:8:\"\u0000*\u0000issue\";s:1:\"2\";s:8:\"\u0000*\u0000spage\";s:3:\"159\";s:8:\"\u0000*\u0000epage\";s:3:\"168\";s:8:\"\u0000*\u0000pages\";s:0:\"\";s:7:\"\u0000*\u0000issn\";s:9:\"0025-5610\";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:7:\"CHEN, W\";}s:9:\"\u0000*\u0000aucorp\";s:0:\"\";s:7:\"\u0000*\u0000isbn\";s:0:\"\";s:8:\"\u0000*\u0000coden\";s:6:\"MHPGA4\";s:8:\"\u0000*\u0000genre\";s:10:\"proceeding\";s:7:\"\u0000*\u0000part\";s:0:\"\";s:9:\"\u0000*\u0000btitle\";s:49:\"Network optimization: Algorithms and applications\";s:8:\"\u0000*\u0000title\";s:75:\"On strongly polynomial dual simplex algorithms for the maximum flow problem\";s:8:\"\u0000*\u0000place\";s:10:\"Heidelberg\";s:6:\"\u0000*\u0000pub\";s:8:\"Springer\";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
