On implementing push-relabel method for the maximum flow problem

DOI10.1007/3-540-59408-6_49MaRDI QIDQ5101413zbMATH OpenOpenAlexWikidataFDO

Authors Boris V. Cherkassky, Andrew V. Goldberg

Publication date 30 August 2022

Published in Integer Programming and Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-59408-6_49

zbMATH Keywords

combination of heuristicsspeedup

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• On implementing the push-relabel method for the maximum flow problem
• scientific article; zbMATH DE number 515925
• A computational study of the pseudoflow and push-relabel algorithms for the maximum flow problem
• scientific article; zbMATH DE number 515928
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• Push-relabel based algorithms for the maximum transversal problem
• A new approach to the maximum-flow problem
• scientific article; zbMATH DE number 176469

Cites work

• A new approach to the maximum-flow problem
• A simple version of Karzanov's blocking flow algorithm
• Analysis of Preflow Push Algorithms for Maximum Network Flow
• DIMACS
• scientific article; zbMATH DE number 3174052 (Why is no real title available?)
• scientific article; zbMATH DE number 4204092 (Why is no real title available?)
• scientific article; zbMATH DE number 176469 (Why is no real title available?)
• scientific article; zbMATH DE number 177817 (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 515922 (Why is no real title available?)
• scientific article; zbMATH DE number 515923 (Why is no real title available?)
• scientific article; zbMATH DE number 634019 (Why is no real title available?)
• scientific article; zbMATH DE number 742960 (Why is no real title available?)
• scientific article; zbMATH DE number 3349645 (Why is no real title available?)
• scientific article; zbMATH DE number 3069634 (Why is no real title available?)
• Implementing Goldberg's max-flow-algorithm ? A computational investigation
• Improved Time Bounds for the Maximum Flow Problem
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Cited in

(15)

• Processor-efficient implementation of a maximum flow algorithm
• Plant location with minimum inventory
• On implementing the push-relabel method for the maximum flow problem
• A Benders decomposition based framework for solving cable trench problems
• Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
• Solving minimum-cost shared arborescence problems
• Mixed-integer programming approaches for the time-constrained maximal covering routing problem
• Mixed-integer programming approaches for the tree \(t^*\)-spanner problem
• A two-phase greedy algorithm to locate and allocate hubs for fixed-wireless broadband access
• Efficient implementation of a synchronous parallel push-relabel algorithm
• The Partial Augment–Relabel Algorithm for the Maximum Flow Problem
• scientific article; zbMATH DE number 515925 (Why is no real title available?)
• TBGMax: leveraging two-boundary graph pattern for lossless maximum-flow acceleration
• Exact approaches for network design problems with relays
• Vertex covering with capacitated trees

Describes a project that uses

Uses Software

• DIMACS

This page was built for publication: On implementing 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 Q5101413)