A parametric maximum flow algorithm for bipartite graphs with applications
From MaRDI portal
Publication:1129980
DOI10.1016/0377-2217(93)E0161-PzbMATH Open0928.90006OpenAlexW2046931398MaRDI QIDQ1129980FDOQ1129980
Authors: 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
Recommendations
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- Maximum flows in parametric dynamic networks with lower bounds
- A Fast Parametric Maximum Flow Algorithm and Applications
- Minimum cuts in parametric networks
- A fast algorithm for the generalized parametric minimum cut problem and applications
Deterministic network models in operations research (90B10) Sensitivity, stability, parametric optimization (90C31)
Cites Work
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
- Title not available (Why is that?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- Scheduling with deadlines and loss functions
- Some simple scheduling algorithms
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Title not available (Why is that?)
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Fast Algorithms for Bipartite Network Flow
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
Cited In (7)
- A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
- Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
- Title not available (Why is that?)
- Optimization of an SMD placement machine and flows in parametric networks
- Solving Maximum Flow Problems on Real World Bipartite Graphs
- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
This page was built for publication: A parametric maximum flow algorithm for bipartite graphs with applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1129980)
