Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs

DOI10.1007/S10479-015-1807-7MaRDI QIDQ492813zbMATH OpenOpenAlexFDO

Authors Mehdi Ghiyasvand

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

zbMATH Keywords

network flowsclosure graphsparametric bipartite maximum flow problemparametric maximum flow algorithmunbalanced bipartite graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• A parametric maximum flow algorithm for bipartite graphs with applications
• Improved Algorithms for Bipartite Network Flow
• Parametric flows in static networks
• Fast Algorithms for Bipartite Network Flow
• A Fast Parametric Maximum Flow Algorithm and Applications

Cites work

• scientific article; zbMATH DE number 3643026 (Why is no real title available?)
• scientific article; zbMATH DE number 3475221 (Why is no real title available?)
• scientific article; zbMATH DE number 3366749 (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
• A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• A parametric maximum flow algorithm for bipartite graphs with applications
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• Fast Algorithms for Bipartite Network Flow
• Improved Algorithms for Bipartite Network Flow
• Job Completion Based Inventory Systems: Optimal Policies for Repair Kits and Spare Machines
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
• Optimal attack and reinforcement of a network
• Possible Winners in Partially Completed Tournaments
• Scheduling with deadlines and loss functions
• Some simple scheduling algorithms
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• Unimodular functions

Cited in

(2)

• scientific article; zbMATH DE number 2094562 (Why is no real title available?)
• Solving Maximum Flow Problems on Real World Bipartite Graphs

This page was built for publication: Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q492813)