On implementing the push-relabel method for the maximum flow problem
From MaRDI portal
Recommendations
Cited in
(75)- Computational investigations of maximum flow algorithms
- Structural relatedness via flow networks in protein sequence space
- Branch-and-cut methods for the network design problem with vulnerability constraints
- Extended formulations and branch-and-cut algorithms for the black-and-white traveling salesman problem
- A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Formalizing network flow algorithms: a refinement approach in Isabelle/HOL
- A computational study of the capacity scaling algorithm for the maximum flow problem
- A generalization of the scaling max-flow algorithm
- A visibility-based surface reconstruction method on the GPU
- A tailored Benders decomposition approach for last-mile delivery with autonomous robots
- Enhanced instance space analysis for the maximum flow problem
- Fair-by-design matching
- Stronger MIP formulations for the Steiner forest problem
- A distributed mincut/maxflow algorithm combining path augmentation and push-relabel
- The two-level diameter constrained spanning tree problem
- Exact approaches for solving robust prize-collecting Steiner tree problems
- Partition-based logical reasoning for first-order and propositional theories
- Efficient preflow push algorithms
- A surface reconstruction method using global graph cut optimization
- A compaction scheme and generator for distribution networks
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Locating leak detecting sensors in a water distribution network by solving prize-collecting Steiner arborescence problems
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
- Optimal monotone relabelling of partially non-monotone ordinal data
- Exact approaches to the single-source network loading problem
- Single-commodity robust network design with finite and hose demand sets
- Minimum-cost flow algorithms: an experimental evaluation
- An analysis of the highest-level selection rule in the preflow-push max-flow algorithm
- Hop constrained Steiner trees with multiple root nodes
- Dimensioning multicast-enabled communications networks
- Integer programming models and branch-and-cut approaches to generalized \(\{0,1,2\}\)-survivable network design problems
- Layered graph models and exact algorithms for the generalized hop-constrained minimum spanning tree problem
- ILP heuristics and a new exact method for bi-objective 0/1 ILPs: application to fttx-network design
- Efficient implementation of a synchronous parallel push-relabel algorithm
- Faster and more dynamic maximum flow by incremental breadth-first search
- The Generalized Regenerator Location Problem
- The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
- scientific article; zbMATH DE number 515923 (Why is no real title available?)
- scientific article; zbMATH DE number 515925 (Why is no real title available?)
- scientific article; zbMATH DE number 515926 (Why is no real title available?)
- Aggregation of monotone reciprocal relations with application to group decision making
- A column generation approach for multicast routing and wavelength assignment with delay constraints in heterogeneous WDM networks
- Algorithm 1002: Graph coloring based parallel push-relabel algorithm for the maximum flow problem
- An Exact Algorithm for the Steiner Forest Problem
- Recent developments in maximum flow algorithms
- Optimization Strategies for Resource-Constrained Project Scheduling Problems in Underground Mining
- On implementing push-relabel method for the maximum flow problem
- On the critical exponent of the 5D random-field Ising model
- Mathematical Programming Algorithms for Spatial Cloaking
- Simplifications and speedups of the pseudoflow algorithm
- Efficient branch-and-bound algorithms for weighted MAX-2-SAT
- Adaptive memory in multistart heuristics for multicommodity network design
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
- Rapidly computing robust minimum capacity s-t cuts: a case study in solving a sequence of maximum flow problems
- Strong Formulations for 2-Node-Connected Steiner Network Problems
- Improved algorithms for the Steiner problem in networks
- An efficient network flow code for finding all minimum cost \(s-t\) cutsets
- A survey on exact algorithms for the maximum flow and minimum‐cost flow problems
- An exact algorithm for solving the vertex separator problem
- On the impact of initialisation strategies on maximum flow algorithm performance
- Branch-and-cut-and-price for capacitated connected facility location
- Solving the minimum label spanning tree problem by mathematical programming techniques
- Estimation of mean dynamic outgoing network flow value
- Scalable high-quality hypergraph partitioning
- Models and methods for standardization problems
- MIP models for connected facility location: a theoretical and computational study
- Lagrangian decompositions for the two-level FTTx network design problem
- Solving a k-node minimum label spanning arborescence problem to compress fingerprint templates
- Approximation algorithms for treewidth
- Anomalous electrical and frictionless flow conductance in complex networks
- PILOT, GRASP, and VNS approaches for the static balancing of bicycle sharing systems
- Transport between multiple users in complex networks
- Low-energy excitations in the three-dimensional random-field Ising model
This page was built for publication: On implementing the push-relabel method for the maximum flow problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1386767)
