Average case performance of heuristics for multi-dimensional assignment problems
classification
💻 cs.DM
keywords
algorithmassignmentdimensionalefficientmulti-dimensionalproblemproblemsalternating-path
read the original abstract
We consider multi-dimensional assignment problems in a probabilistic setting. Our main results are: (i) A new efficient algorithm for the 3-dimensional planar problem, based on enumerating and selecting from a set of "alternating-path trees"; (ii) A new efficient matching-based algorithm for the 3-dimensional axial problem.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.