Average Case Analysis of a Heuristic for the Assignment Problem
From MaRDI portal
Recommendations
Cited in
(11)- An analysis of a decomposition heuristic for the assignment problem
- An average case analysis of the minimum spanning tree heuristic for the power assignment problem
- Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
- Selected topics on assignment problems
- Constructive bounds and exact expectations for the random assignment problem
- The ``largest element first heuristic for the maximization assignment problem
- scientific article; zbMATH DE number 7651215 (Why is no real title available?)
- Optimality of belief propagation for random assignment problem
- The Probabilistic Analysis of a Heuristic for the Assignment Problem
- Average value of solutions of the bipartite quadratic assignment problem and linkages to domination analysis
- scientific article; zbMATH DE number 1496581 (Why is no real title available?)
This page was built for publication: Average Case Analysis of a Heuristic for the Assignment Problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4316542)