default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDIMACS Workshop: Network Flows And Matching 1991
- David S. Johnson, Catherine C. McGeoch:
Network Flows And Matching, Proceedings of a DIMACS Workshop, New Brunswick, New Jersey, USA, October 14-16, 1991. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 12, DIMACS/AMS 1993, ISBN 978-0-8218-6598-9 - Foreword. Network Flows And Matching 1991: ix-
- David S. Johnson, Catherine C. McGeoch:
Preface. Network Flows And Matching 1991: xi- - Richard J. Anderson, João Carlos Setubal:
Goldberg's Algorithm for Maximum Flow in Perspective: A Computational Study. 1-18 - Q. C. Nguyen, Venkat Venkateswaran:
Implementations of the Goldberg-Tarjan Maximum Flow Algorithm. 19-41 - Tamás Badics, Endre Boros:
Implementing a Maximum Flow Algorithm: Experiments with Dynamic Trees. 43-63 - Farid Alizadeth, Andrew V. Goldberg:
Implementing the Push-Relabel Method for the Maximum Flow Problem on a Connection Machine. 65-95 - Gregory E. Shannon, John MacCuish, Elisabeth Johnson:
A Case Study in Algorithm Animation: Maximum Flow Algorithms. 97-118 - Robert G. Bland, Joseph Cheriyan, David L. Jensen, Laszlo Ladányi:
An Empirical Study of Min Cost Flow Algorithms for the Minimum-Cost Flow Problem. 119-156 - Andrew V. Goldberg, Michael Kharitonov:
On Implementing Scaling Push-Relabel Algorithms for the Minimum-Cost Flow Problem. 157-198 - István Maros:
Performance Evaluation of the MINET Minimum Cost Netflow Solver. 199-217 - Satoru Fujishige, Kazuo Iwano, J. Nakano, Shu Tezuka:
A Speculative Contraction Method for Minimum Cost Flows: Toward a Practical Algorithm. 219-245 - S. Thomas McCormick, Li Liu:
An Experimental Implementation of the Dual Cancel and Tighten Algorithm for Minimum-Cost Network Flow. 247-266 - Anil Joshi, Arthur S. Goldstein, Pravin M. Vaidya:
A Fast Implementation of a Path-Following Algorithm for Maximizing a Linear Function over a Network Polytope. 267-298 - Mauricio G. C. Resende, Geraldo Veiga:
An Efficient Implementation of a Network Interior Point Method. 299-348 - Søren S. Nielsen, Stavros A. Zenios:
On the Massively Parallel Solution of Linear Network Flow Problems. 349-369 - James M. Borger, Sarah Kang, Philip N. Klein:
Approximating Concurrent Flow with Unit Demands and Capacities: An Implementation. 371-386 - Tishya Leong, Peter W. Shor, Clifford Stein:
Implementation of a Combinatorial Multicommodity Flow Algorithm. 387-405 - David A. Castañón:
Reverse Auction Algorithms for Assignment Problems. 407-429 - K. G. Ramakrishnan, Narendra Karmarkar, Anil P. Kamath:
An Approximate Dual Projective Algorithm for Solving Assignment Problems. 431-451 - Jack Jianxiu Hao, George Kocur:
An Implementation of a Shortest Augmenting Path Algorithm for the Assignment Problem. 453-468 - Martin Lee Brady, Kenneth K. Jung, H. T. Nguyen, Raghu Raghavan, Ramesh Subramonian:
The Assignment Problem on Parallel Architectures. 469-517 - Steven T. Crocker:
An Experimental Comparison of Two Maximum Cardinality Matching Programs. 519-537 - R. Bruce Mattingly, Nathan P. Ritchey:
Implementing on O(/NM) Cardinality Matching Algorithm. 539-556 - David L. Applegate, William J. Cook:
Solving Large-Scale Matching Problems. 557-576 - Catherine C. McGeoch:
Appendix A: Electronically Available Materials. 577-582 - David S. Johnson:
Appendix B: Panel Discussion Highlights. 583-592
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.
last updated on 2024-10-18 19:37 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
