Linear assignment procedures

DOI10.1016/S0377-2217(98)00361-0zbMath1009.90067OpenAlexW2058031859MaRDI QIDQ1610146

A. Volgenant, Roy Jonker

Publication date: 18 August 2002

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(98)00361-0

zbMATH Keywords

linear assignmentcore approachsemi-assignment

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Graph theory (including graph drawing) in computer science (68R10) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08) Discrete location and assignment (90B80)

Related Items

Solving the \(k\)-cardinality assignment problem by transformation

Uses Software

• Turbo Pascal

Cites Work

• Unnamed Item
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Improved complexity bound for the maximum cardinality bottleneck bipartite matching problem
• An efficient cost scaling algorithm for the assignment problem
• Linear and semi-assignment problems: A core oriented approach
• An in-core/out-of-core method for solving large scale assignment problems
• A Shortest Augmenting Path Algorithm for the Semi-Assignment Problem
• On some techniques useful for solution of transportation network problems