scientific article; zbMATH DE number 487935
From MaRDI portal
Publication:4276004
zbMath0781.00013MaRDI QIDQ4276004
No author found.
Publication date: 9 January 1994
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Proceedings of conferences of miscellaneous specific interest (00B25) Deterministic network models in operations research (90B10) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06)
Related Items (20)
Efficient transitive closure of sparse matrices over closed semirings ⋮ Efficient Implementation of a Synchronous Parallel Push-Relabel Algorithm ⋮ GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU ⋮ An efficient cost scaling algorithm for the assignment problem ⋮ Shortest paths algorithms: Theory and experimental evaluation ⋮ TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration ⋮ On implementing push-relabel method for the maximum flow problem ⋮ Reconstructing \((h,v)\)-convex \(2\)-dimensional patterns of objects from approximate horizontal and vertical projections. ⋮ Algorithms and codes for dense assignment problems: The state of the art ⋮ Effective use of Boolean satisfiability procedures in the formal verification of superscalar and VLIW microprocessors. ⋮ Formalizing network flow algorithms: a refinement approach in Isabelle/HOL ⋮ Efficient preflow push algorithms ⋮ A computational study of the capacity scaling algorithm for the maximum flow problem ⋮ A new \textsf{DSATUR}-based algorithm for exact vertex coloring ⋮ A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks ⋮ Blossom V: A new implementation of a minimum cost perfect matching algorithm ⋮ A genetic-based framework for solving (multi-criteria) weighted matching problems. ⋮ Algorithms for network piecewise-linear programs: A comparative study ⋮ Computational investigations of maximum flow algorithms ⋮ An information-based neural approach to generic constraint satisfaction.
Uses Software
This page was built for publication:
