AN EFFICIENT COST SCALING ALGORITHM FOR THE INDEPENDENT ASSIGNMENT PROBLEM

DOI10.15807/JORSJ.38.124MaRDI QIDQ4860670zbMATH OpenOpenAlexFDO

Authors Satoru Fujishige, Xiaodong Zhang

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 graphcost scaling algorithmindependent assignment problemweighted matroid intersection problem

Mathematics Subject Classification ID

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

Recommendations

• An efficient cost scaling algorithm for the assignment problem
• Faster Scaling Algorithms for Network Problems
• New scaling algorithms for the assignment and minimum mean cycle problems
• scientific article; zbMATH DE number 176471
• Faster scaling algorithms for general graph matching problems

Cited in

(6)

• An efficient cost scaling algorithm for the assignment problem
• A dual approximation approach to weighted matroid intersection
• Exact and approximation algorithms for weighted matroid intersection
• Valuated Matroid Intersection II: Algorithms
• A cost-scaling algorithm for \(0-1\) submodular flows
• Adaptive sparsification for matroid intersection

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

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