On the impact of initialisation strategies on maximum flow algorithm performance
From MaRDI portal
Cites work
- A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
- A new approach to the maximum-flow problem
- Computational investigations of maximum flow algorithms
- Enhanced instance space analysis for the maximum flow problem
- Faster and more dynamic maximum flow by incremental breadth-first search
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- Instance spaces for machine learning classification
- Max flows in O(nm) time, or better
- Maximal Flow Through a Network
- Network flows. Theory, algorithms, and applications.
- On implementing the push-relabel method for the maximum flow problem
- On the comparison of initialisation strategies in differential evolution for large scale optimisation
- SATzilla: portfolio-based algorithm selection for SAT
- Simplifications and speedups of the pseudoflow algorithm
- Testing heuristics: We have it all wrong
- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
- The Pseudoflow Algorithm: A New Algorithm for the Maximum-Flow Problem
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Towards objective measures of algorithm performance across instance space
This page was built for publication: On the impact of initialisation strategies on maximum flow algorithm performance
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6551097)