An analysis of a decomposition heuristic for the assignment problem

DOI10.1016/0167-6377(85)90001-XzbMath0573.90069OpenAlexW2049737014MaRDI QIDQ1062912

David Avis, Luc P. Devroye

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

zbMATH Keywords

decompositionapproximate solutionsperformance analysisanalysis of algorithmsassignment problemheuristic solution

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Numerical mathematical programming methods (65K05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Related Items (3)

Personnel placement in a fuzzy environment ⋮ An extended assignment problem considering multiple inputs and outputs ⋮ Random assignment problems

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

This page was built for publication: An analysis of a decomposition heuristic for the assignment problem