An analysis of a decomposition heuristic for the assignment problem
From MaRDI portal
Publication:1062912
DOI10.1016/0167-6377(85)90001-XzbMath0573.90069MaRDI QIDQ1062912
Publication date: 1985
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(85)90001-x
decomposition; approximate solutions; performance analysis; analysis of algorithms; assignment problem; heuristic solution
68Q25: Analysis of algorithms and problem complexity
65K05: Numerical mathematical programming methods
90C08: Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.)
Related Items
Random assignment problems, Personnel placement in a fuzzy environment, An extended assignment problem considering multiple inputs and outputs
Cites Work
- Unnamed Item
- Laws of the iterated logarithm for order statistics of uniform spacings
- On the Expected Value of a Random Assignment Problem
- A survey of heuristics for the weighted matching problem
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- On Approximation Methods for the Assignment Problem