An addendum on the incremental assignment problem

DOI10.1016/J.INS.2008.07.020MaRDI QIDQ1007874zbMATH OpenOpenAlexFDO

Authors 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 algorithmlinear assignment problemweighted bipartite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Discrete location and assignment (90B80)

Recommendations

• Incremental assignment problem
• scientific article; zbMATH DE number 1787233
• A scaling algorithm for maximum weight matching in bipartite graphs
• scientific article; zbMATH DE number 515939
• scientific article; zbMATH DE number 841607

Cites work

• scientific article; zbMATH DE number 3231692 (Why is no real title available?)
• Improving the Hungarian assignment algorithm
• Incremental assignment problem
• Network flows. Theory, algorithms, and applications.
• On some techniques useful for solution of transportation network problems
• Statement forNaval Research Logistics

Cited in

(5)

• Extra heads and invariant allocations
• Incremental Processing Applied to Munkres’ Algorithm and Its Application in Steinberg’s Placement Procedure
• scientific article; zbMATH DE number 1787233 (Why is no real title available?)
• An Incremental Model for Combinatorial Maximization Problems
• Incremental assignment problem

This page was built for publication: An addendum on the incremental assignment problem

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