No label defined (Q4276004)

From MaRDI portal

!

This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:

scientific article; zbMATH DE number 487935
Language Label Description Also known as
default for all languages
No label defined
    English
    No label defined
    scientific article; zbMATH DE number 487935

      Statements

      9 January 1994
      0 references
      Piscataway, NJ (USA)
      0 references
      Matching
      0 references
      Network flows
      0 references
      Rutgers University
      0 references
      DIMACS Implementation Challenge
      0 references
      The articles of this volume will be reviewed individually. Indexed articles: \textit{Anderson, Richard J.; Setubal, João C.}, Goldberg's algorithm for maximum flow in perspective: A computational study, 1-18 [Zbl 0787.90018] \textit{Nguyen, Q. C.; Venkateswaran, V.}, Implementations of the Goldberg-Tarjan maximum flow algorithm, 19-41 [Zbl 0787.90025] \textit{Badics, T.; Boros, E.}, Implementing a maximum flow algorithm: Experiments with dynamic trees, 43-63 [Zbl 0796.90021] \textit{Alizadeh, Farid; Goldberg, Andrew V.}, Implementing the push-relabel method for the maximum flow problem on a connection machine, 65-95 [Zbl 0796.90020] \textit{Shannon, Gregory E.; MacCuish, John; Johnson, Elizabeth}, A case study in algorithm animation: Maximum flow algorithms, 97-118 [Zbl 0789.68073] \textit{Bland, R. G.; Cheriyan, J.; Jensen, D. L.; Ladányi, L.}, An empirical study of min cost flow algorithms, 119-156 [Zbl 0787.90019] \textit{Goldberg, Andrew V.; Kharitonov, Michael}, On implementing scaling push-relabel algorithms for the minimum-cost flow problem, 157-198 [Zbl 0787.90021] \textit{Maros, István}, Performance evaluation of the MINET minimum cost netflow solver, 199-217 [Zbl 0787.90023] \textit{Fujishige, Satoru; Iwano, Kazuo; Nakano, Jun; Tezuka, Shu}, A speculative contraction method for minimum cost flows: Toward a practical algorithm, 219-245 [Zbl 0787.90020] \textit{McCormick, S. Thomas; Liu, Li}, An experimental implementation of the dual cancel and tighten algorithm for minimum-cost network flow, 247-266 [Zbl 0787.90024] \textit{Joshi, Anil; Goldstein, Arthur S.; Vaidya, Pravin M.}, A fast implementation of a path-following algorithm for maximizing a linear function over a network polytope, 267-298 [Zbl 0787.90022] \textit{Resende, Mauricio G. C.; Veiga, Geraldo}, An efficient implementation of a network interior point method, 299-348 [Zbl 0787.90028] \textit{Nielsen, Soren S.; Zenios, Stavros A.}, On the massively parallel solution of linear network flow problems, 349-369 [Zbl 0787.90026] \textit{Borger, James M.; Kang, Taekyung S.; Klein, Philip N.}, Approximating concurrent flow with unit demands and capacities: An implementation, 371-386 [Zbl 0789.68060] \textit{Leong, Tishya; Shor, Peter; Stein, Clifford}, Implementation of a combinatorial multicommodity flow algorithm, 387-405 [Zbl 0796.90022] \textit{Castañon, David A.}, Reverse auction algorithms for assignment problems, 407-429 [Zbl 0788.90056] \textit{Ramakrishnan, K. G.; Karmarkar, N. K.; Kamath, A. P.}, An approximate dual projective algorithm for solving assignment problems, 431-451 [Zbl 0788.90049] \textit{Hao, Jianxiu; Kocur, George}, An implementation of a shortest augmenting path algorithm for the assignment problem, 453-468 [Zbl 0797.90022] \textit{Brady, M.; Jung, K. K.; Nguyen, H. T.; Raghavan, R.; Subramonian, R.}, The assignment problem on parallel architectures, 469-517 [Zbl 0788.90061] \textit{Crocker, Steven T.}, An experimental comparison of two maximum cardinality matching programs, 519-537 [Zbl 0795.05132] \textit{Mattingly, R. Bruce; Ritchey, Nathan P.}, Implementing an \(O(\sqrt{N}M)\) cardinality matching algorithm, 539-556 [Zbl 0789.68114] \textit{Applegate, David; Cook, William}, Solving large-scale matching problems, 557-576 [Zbl 0788.90059]
      0 references

      Identifiers

      0 references
      0 references
      0 references
      0 references
      0 references