Implementation and Testing of a Primal-Dual Algorithm for the Assignment Problem
From MaRDI portal
Publication:4745608
DOI10.1287/opre.31.2.277zbMath0507.90055OpenAlexW2160149076MaRDI QIDQ4745608
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
assignment problemstestingimplementationprimal-dual algorithmcomparison of algorithmscomputational comparisonsprimal simplex algorithms
Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)
Related Items
Improving the Hungarian assignment algorithm, A shortest augmenting path algorithm for dense and sparse linear assignment problems, Primal-dual algorithms for the assignment problem, Max-min matching problems with multiple assignments, The auction algorithm for the transportation problem, Algorithms and codes for dense assignment problems: The state of the art, Goal programming in the context of the assignment problem and a computationally effective solution method, A hybrid heuristic for a broad class of vehicle routing problems with heterogeneous fleet, An extended assignment problem considering multiple inputs and outputs, A variant of time minimizing assignment problem, A unified framework for primal-dual methods in minimum cost network flow problems, The auction algorithm: A distributed relaxation method for the assignment problem
Uses Software
