Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem

DOI10.1287/OPRE.31.2.277MaRDI QIDQ4745608zbMATH OpenOpenAlexFDO

Authors Leon F. McGinnis

Publication date 1983

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.31.2.277

zbMATH Keywords

assignment problemscomparison of algorithmscomputational comparisonsimplementationprimal simplex algorithmsprimal-dual algorithmtesting

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Cited in

(13)

• Improving the Hungarian assignment algorithm
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Primal-dual algorithms for the assignment problem
• A variant of time minimizing assignment problem
• The auction algorithm: A distributed relaxation method for the assignment problem
• Max-min matching problems with multiple assignments
• A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet
• Algorithms and codes for dense assignment problems: The state of the art
• An extended assignment problem considering multiple inputs and outputs
• A unified framework for primal-dual methods in minimum cost network flow problems
• Belief propagation for unbalanced assignment problem
• The auction algorithm for the transportation problem
• Goal programming in the context of the assignment problem and a computationally effective solution method

Describes a project that uses

Uses Software

• NETGEN

This page was built for publication: Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem

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