A new algorithm for the assignment problem: An alternative to the Hungarian method

DOI10.1016/S0305-0548(97)00019-1zbMath0889.90115OpenAlexW2030497423MaRDI QIDQ1374026

J. Ning

Publication date: 2 December 1997

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0305-0548(97)00019-1

zbMATH Keywords

assignment

Mathematics Subject Classification ID

Linear programming (90C05) Discrete location and assignment (90B80) Boolean programming (90C09)

Related Items (4)

A study on two measurements-to-tracks data assignment algorithms ⋮ A labeling algorithm for the sensitivity ranges of the assignment problem ⋮ Data association approaches in bearings-only multi-target tracking ⋮ A new algorithm of bearings-only multi-target tracking of bistatic system

Cites Work

• Unnamed Item
• Unnamed Item
• An infeasible (exterior point) simplex algorithm for assignment problems
• New scaling algorithms for the assignment and minimum mean cycle problems
• A labeling algorithm to solve the assignment problem
• Technical Note—A Polynomial Simplex Method for the Assignment Problem
• Efficient dual simplex algorithms for the assignment problem
• Signature Methods for the Assignment Problem
• A competitive (dual) simplex method for the assignment problem
• Solving the Assignment Problem by Relaxation

This page was built for publication: A new algorithm for the assignment problem: An alternative to the Hungarian method