scientific article; zbMATH DE number 487935
From MaRDI portal
Publication:4276004
Proceedings of conferences of miscellaneous specific interest (00B25) Proceedings, conferences, collections, etc. pertaining to computer science (68-06) Proceedings, conferences, collections, etc. pertaining to operations research and mathematical programming (90-06) Deterministic network models in operations research (90B10)
Cited in
(21)- Algorithms for network piecewise-linear programs: A comparative study
- Computational investigations of maximum flow algorithms
- Reconstructing (h,v)-convex 2-dimensional patterns of objects from approximate horizontal and vertical projections.
- 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
- A computational study of the capacity scaling algorithm for the maximum flow problem
- A new \textsf{DSATUR}-based algorithm for exact vertex coloring
- A genetic-based framework for solving (multi-criteria) weighted matching problems.
- An information-based neural approach to generic constraint satisfaction.
- An efficient cost scaling algorithm for the assignment problem
- Shortest paths algorithms: Theory and experimental evaluation
- Algorithms and codes for dense assignment problems: The state of the art
- A specialized interior-point algorithm for huge minimum convex cost flows in bipartite networks
- Efficient transitive closure of sparse matrices over closed semirings
- Efficient preflow push algorithms
- Efficient implementation of a synchronous parallel push-relabel algorithm
- GraphBLAST: A High-Performance Linear Algebra-based Graph Framework on the GPU
- TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
- On implementing push-relabel method for the maximum flow problem
- Maximum flow and minimum-cost flow in almost-linear time
- Blossom V: A new implementation of a minimum cost perfect matching algorithm
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4276004)
