Global Price Updates Help

DOI10.1137/S0895480194281185zbMath0891.90162OpenAlexW1973907457MaRDI QIDQ4377450

No author found.

Publication date: 9 February 1998

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s0895480194281185

zbMATH Keywords

assignment problembipartite matchingpush-relabel algorithmcost scalingdual updatezero-one flow

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Deterministic network models in operations research (90B10) Parallel algorithms in computer science (68W10)

Related Items (6)

The assignment problem revisited ⋮ Linear-Time Approximation for Maximum Weight Matching ⋮ An efficient cost scaling algorithm for the assignment problem ⋮ Minimum-cost flows in unit-capacity networks ⋮ A simple reduction from maximum weight matching to maximum cardinality matching ⋮ Unnamed Item

This page was built for publication: Global Price Updates Help