A parametric maximum flow algorithm for bipartite graphs with applications
From MaRDI portal
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
Cites work
- scientific article; zbMATH DE number 3475221 (Why is no real title available?)
- scientific article; zbMATH DE number 3349645 (Why is no real title available?)
- A Fast Parametric Maximum Flow Algorithm and Applications
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Fast Algorithms for Bipartite Network Flow
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Scheduling with deadlines and loss functions
- Some simple scheduling algorithms
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Cited in
(7)- Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
- 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
- scientific article; zbMATH DE number 2094562 (Why is no real title available?)
- Applications of the Dulmage--Mendelsohn Decomposition and Network Flow to Graph Bisection Improvement
- Solving Maximum Flow Problems on Real World Bipartite Graphs
- Optimization of an SMD placement machine and flows in parametric networks
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)
