Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
From MaRDI portal
Publication:492813
DOI10.1007/s10479-015-1807-7zbMath1352.90101OpenAlexW2087384475MaRDI QIDQ492813
Publication date: 21 August 2015
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-015-1807-7
network flowsclosure graphsparametric bipartite maximum flow problemparametric maximum flow algorithmunbalanced bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unimodular functions
- A parametric maximum flow algorithm for bipartite graphs with applications
- An \(O(IVI^3)\) algorithm for finding maximum flows in networks
- Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- 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
- A new?old algorithm for minimum-cut and maximum-flow in closure graphs
- Scheduling with Deadlines and Loss Functions
- Fast Algorithms for Bipartite Network Flow
- Job Completion Based Inventory Systems: Optimal Policies for Repair Kits and Spare Machines
- Optimal attack and reinforcement of a network
- A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
- Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
- Improved Algorithms for Bipartite Network Flow
- Some simple scheduling algorithms
- A Fast Parametric Maximum Flow Algorithm and Applications
- Possible Winners in Partially Completed Tournaments
This page was built for publication: Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
