Computational investigations of maximum flow algorithms
From MaRDI portal
(Redirected from Publication:1278652)
Recommendations
- On the complexity of preflow-push algorithms for maximum-flow problems
- A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
Cites work
- scientific article; zbMATH DE number 3936534 (Why is no real title available?)
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 487935 (Why is no real title available?)
- scientific article; zbMATH DE number 515923 (Why is no real title available?)
- scientific article; zbMATH DE number 515924 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A Fast and Simple Algorithm for the Maximum Flow Problem
- A data structure for dynamic trees
- A new approach to the maximum-flow problem
- A primal simplex algorithm that solves the maximum flow problem in at most nm pivots and O(n^ 2m) time
- A primal simplex variant for the maximum-flow problem
- An \(O(EV\log^2V)\) algorithm for the maximal flow problem
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- An \(O(V^{5/3}E^{2/3})\) algorithm for the maximal flow problem
- An auction algorithm for the max-flow problem
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- Computational Comparison of Eight Methods for the Maximum Network Flow Problem
- Distance-directed augmenting path algorithms for maximum flow and parametric maximum flow problems
- Generating pseudo-random permutations and maximum flow algorithms
- Implementing Goldberg's max-flow-algorithm ? A computational investigation
- Improved Time Bounds for the Maximum Flow Problem
- Maximal Flow Through a Network
- NETGEN: A Program for Generating Large Scale Capacitated Assignment, Transportation, and Minimum Cost Flow Network Problems
- Network flows. Theory, algorithms, and applications.
- Numerical investigations on the maximal flow algorithm of Karzanov
- ON THE PRACTICAL EFFICIENCY OF VARIOUS MAXIMUM FLOW ALGORITHMS
- On implementing the push-relabel method for the maximum flow problem
- On strongly polynomial variants of the networks simplex algorithm for the maximum flow problem
- Scaling algorithms for network problems
- The maximum flow problem: A max-preflow approach
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Toward a Programming Environment for Combinatorial Optimization: A Case Study Oriented to Max-Flow Computations
- Use of Representative Operation Counts in Computational Testing of Algorithms
- Use of dynamic trees in a network simplex algorithm for the maximum flow problem
Cited in
(24)- A minimal path-based method for computing multistate network reliability
- scientific article; zbMATH DE number 515922 (Why is no real title available?)
- Reliability evaluation of multi-state systems under cost consideration
- An algorithmic study of the maximum flow problem: A comparative statistical analysis
- Reachability cuts for the vehicle routing problem with time windows
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- Simplifications and speedups of the pseudoflow algorithm
- scientific article; zbMATH DE number 2163908 (Why is no real title available?)
- Efficient enumeration of d-minimal paths in reliability evaluation of multistate networks
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
- A computational study of the capacity scaling algorithm for the maximum flow problem
- A generalization of the scaling max-flow algorithm
- scientific article; zbMATH DE number 515926 (Why is no real title available?)
- Preemptive benchmarking problem: An approach for official statistics in small areas
- Composability and controllability of structural linear time-invariant systems: distributed verification
- A new approach to computing maximum flows using electrical flows
- A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
- Assessing the reliability of a multistate logistics network under the transportation cost constraint
- Networked dynamical systems 2016
- Enhanced instance space analysis for the maximum flow problem
- A dynamic bounding algorithm for approximating multi-state two-terminal reliability
- Algorithms for distributing telecommunication traffic on a multiple-ring SONET-based network.
- Analysis of Preflow Push Algorithms for Maximum Network Flow
- On the impact of initialisation strategies on maximum flow algorithm performance
This page was built for publication: Computational investigations of maximum flow algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278652)
