An addendum on the incremental assignment problem

DOI10.1016/j.ins.2008.07.020zbMath1156.05334OpenAlexW2106234295MaRDI QIDQ1007874

A. Volgenant

Publication date: 24 March 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2008.07.020

zbMATH Keywords

Hungarian algorithmweighted bipartite graphlinear assignment problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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
• Unnamed Item
• Incremental assignment problem
• Improving the Hungarian assignment algorithm
• Statement forNaval Research Logistics
• On some techniques useful for solution of transportation network problems