Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
type: Item
instance of: scholarly article
title: Solving the parametric bipartite maximum flow problem in unbalanced and closure bipartite graphs
zbMATH Open document ID: 1352.90101
author: Mehdi Ghiyasvand
published in: Annals of Operations Research
publication date: 2015-08-21T00:00:00Z
Mathematics Subject Classification ID: 90C35
zbMATH DE Number: 6474564
zbMATH Keywords: network flows
zbMATH Keywords: parametric bipartite maximum flow problem
zbMATH Keywords: closure graphs
zbMATH Keywords: unbalanced bipartite graphs
zbMATH Keywords: parametric maximum flow algorithm
MaRDI profile type: Publication
full work available at URL: s10479-015-1807-7
OpenAlex ID: W2087384475
cites work: Improved Algorithms for Bipartite Network Flow
cites work: Network flow approaches to pre-emptive open-shop scheduling problems with time-windows
cites work: A parametric maximum flow algorithm for bipartite graphs with applications
cites work: Optimal attack and reinforcement of a network
cites work: Mathematical Techniques for Efficient Record Segmentation in Large Shared Databases
cites work: A Fast Parametric Maximum Flow Algorithm and Applications
cites work: Fast Algorithms for Bipartite Network Flow
cites work: Unimodular functions
cites work: Q5639561
cites work: Possible Winners in Partially Completed Tournaments
cites work: A new-old algorithm for minimum-cut and maximum-flow in closure graphs.
cites work: Tight bounds and 2-approximation algorithms for integer programs with two variables per inequality
cites work: About strongly polynomial time algorithms for quadratic optimization over submodular constraints
cites work: Some simple scheduling algorithms
cites work: Q4058442
cites work: Q3048571
cites work: An \(O(IVI^3)\) algorithm for finding maximum flows in networks
cites work: Job Completion Based Inventory Systems: Optimal Policies for Repair Kits and Spare Machines
cites work: Scheduling with deadlines and loss functions
cites work: A network flow solution to some nonlinear 0-1 programming problems, with applications to graph theory
cites work: A network flow-based method to solve performance cost and makespan open-shop scheduling problems with time-windows
DOI: 10.1007/S10479-015-1807-7
description: scientific article; zbMATH DE number 6474564