The recurrent method to solve the assignment problem

DOI10.1007/S10559-015-9786-XzbMath1334.90067OpenAlexW2341912396MaRDI QIDQ269147

A. V. Panishev, A. V. Morozov, O. B. Matsiy

Publication date: 18 April 2016

Published in: Cybernetics and Systems Analysis (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10559-015-9786-x

zbMATH Keywords

bipartite graphmatchingassignment problemaugmenting path

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Discrete location and assignment (90B80) Graph algorithms (graph-theoretic aspects) (05C85)

Cites Work

• Unnamed Item

This page was built for publication: The recurrent method to solve the assignment problem