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

DOI10.1007/S10479-015-1807-7zbMATH Open1352.90101OpenAlexW2087384475MaRDI QIDQ492813FDOQ492813

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Cites Work

• Title not available (Why is that?)
• Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
• A Fast Parametric Maximum Flow Algorithm and Applications
• Scheduling with deadlines and loss functions
• Some simple scheduling algorithms
• About strongly polynomial time algorithms for quadratic optimization over submodular constraints
• A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
• Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
• Improved Algorithms for Bipartite Network Flow
• Title not available (Why is that?)
• Optimal attack and reinforcement of a network
• Unimodular functions
• A parametric maximum flow algorithm for bipartite graphs with applications
• An \(O(IVI^3)\) algorithm for finding maximum flows in networks
• 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
• Fast Algorithms for Bipartite Network Flow
• Job Completion Based Inventory Systems: Optimal Policies for Repair Kits and Spare Machines
• A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
• Possible Winners in Partially Completed Tournaments
• Title not available (Why is that?)

Cited In (2)

• Title not available (Why is that?)
• 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)