The auction algorithm for assignment and other network flow problems: A tutorial
DP Bertsekas - Interfaces, 1990 - pubsonline.informs.org
The auction algorithm is an intuitive method for solving the classical assignment problem. It
outperforms substantially its main competitors for important types of problems, both in theory …
outperforms substantially its main competitors for important types of problems, both in theory …
[HTML][HTML] Algorithms and codes for dense assignment problems: the state of the art
M Dell'Amico, P Toth - Discrete Applied Mathematics, 2000 - Elsevier
The paper considers the classic linear assignment problem with a min-sum objective
function, and the most efficient and easily available codes for its solution. We first give a …
function, and the most efficient and easily available codes for its solution. We first give a …
[LIVRE][B] Assignment problems: revised reprint
R Burkard, M Dell'Amico, S Martello - 2012 - SIAM
When SIAM asked us to prepare a new edition of this book after less than three years from
publication, we expected a light duty. Just the correction of some typos and imprecisions …
publication, we expected a light duty. Just the correction of some typos and imprecisions …
A shortest augmenting path algorithm for dense and sparse linear assignment problems
R Jonker, T Volgenant - DGOR/NSOR: Papers of the 16th Annual Meeting …, 1988 - Springer
The linear assignment problem (LAP) is useful as a relaxation for difficult combinatorial
optimization problems (quadratic assignment, travelling salesman). Theoretical …
optimization problems (quadratic assignment, travelling salesman). Theoretical …
[LIVRE][B] Hand tracking, finger identification, and chordic manipulation on a multi-touch surface
W Westerman - 1999 - Citeseer
Dr. Neal Gallagher, for inviting me to Delaware, ensuring my research in the Electrical
Engineering Department and other parts of campus was always fully supported, offering …
Engineering Department and other parts of campus was always fully supported, offering …
[LIVRE][B] Network optimization: continuous and discrete models
D Bertsekas - 1998 - books.google.com
An insightful, comprehensive, and up-to-date treatment of linear, nonlinear, and
discrete/combinatorial network optimization problems, their applications, and their analytical …
discrete/combinatorial network optimization problems, their applications, and their analytical …
The auction algorithm: A distributed relaxation method for the assignment problem
DP Bertsekas - Annals of operations research, 1988 - Springer
We propose a massively parallelizable algorithm for the classical assignment problem. The
algorithm operates like an auction whereby unassigned persons bid simultaneously for …
algorithm operates like an auction whereby unassigned persons bid simultaneously for …
Improving the Hungarian assignment algorithm
R Jonker, T Volgenant - Operations research letters, 1986 - Elsevier
We describe three easily implementable improvement for the Hungarian linear assignment
algorithm. Computation times vary from about two to more than three times lower than …
algorithm. Computation times vary from about two to more than three times lower than …
A path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph
matching problem. The convex-concave programming formulation is obtained by rewriting …
matching problem. The convex-concave programming formulation is obtained by rewriting …
A new algorithm for the assignment problem
DP Bertsekas - Mathematical Programming, 1981 - Springer
We propose a new algorithm for the classical assignment problem. The algorithm resembles
in some ways the Hungarian method but differs substantially in other respects. The average …
in some ways the Hungarian method but differs substantially in other respects. The average …