A parametric maximum flow algorithm for bipartite graphs with applications

DOI10.1016/0377-2217(93)E0161-PzbMath0928.90006OpenAlexW2046931398MaRDI QIDQ1129980

S. H. Smith

Publication date: 16 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(93)e0161-p

zbMATH Keywords

bipartite graphmaximum flowparametric algorithmcapacitated bipartite network

Mathematics Subject Classification ID

Sensitivity, stability, parametric optimization (90C31) Deterministic network models in operations research (90B10)

Related Items (4)

A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows ⋮ Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs ⋮ Network flow approaches to pre-emptive open-shop scheduling problems with time-windows ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Scheduling with Deadlines and Loss Functions
• Fast Algorithms for Bipartite Network Flow
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Some simple scheduling algorithms
• A Fast Parametric Maximum Flow Algorithm and Applications

This page was built for publication: A parametric maximum flow algorithm for bipartite graphs with applications