On optimality of a polynomial algorithm for random linear multidimensional assignment problem

Research output: Contribution to journalArticle

2 Scopus citations

Abstract

We demonstrate that the linear multidimensional assignment problem with iid random costs is polynomially e{open}-approximable almost surely (a. s.) via a simple greedy heuristic, for a broad range of probability distributions of the assignment costs. Specifically, conditions on discrete and continuous distributions of the cost coefficients, including distributions with unbounded support, have been established that guarantee convergence to unity in the a. s. sense of the cost ratio between the greedy solution and optimal solution. The corresponding convergence rates have been determined.

Original languageEnglish (US)
Pages (from-to)153-164
Number of pages12
JournalOptimization Letters
Volume5
Issue number1
DOIs
StatePublished - Jan 1 2011
Externally publishedYes

Keywords

  • Approximability
  • Convergence almost surely
  • Greedy heuristic
  • Multidimensional assignment problem

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'On optimality of a polynomial algorithm for random linear multidimensional assignment problem'. Together they form a unique fingerprint.

  • Cite this