AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM

DOI10.15807/jorsj.38.124zbMath0843.90122OpenAlexW2131012775MaRDI QIDQ4860670

Xiaodong Zhang, Satoru Fujishige

Publication date: 19 August 1996

Published in: Journal of the Operations Research Society of Japan (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.15807/jorsj.38.124

zbMATH Keywords

bipartite graphweighted matroid intersection problemcost scaling algorithmindependent assignment problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Discrete location and assignment (90B80) Combinatorial aspects of matroids and geometric lattices (05B35)

Related Items (3)

A dual approximation approach to weighted matroid intersection ⋮ A cost-scaling algorithm for \(0-1\) submodular flows ⋮ Exact and approximation algorithms for weighted matroid intersection

This page was built for publication: AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM