Computational studies of randomized multidimensional assignment problems

Mohammad Mirghorbani, Pavlo Krokhmal, Eduardo L. Pasiliao

Research output: Contribution to journalArticle

Abstract

In this chapter, we consider a class of combinatorial optimization problems on hypergraph matchings that represent multidimensional generalizations of the well-known linear assignment problem (LAP). We present two algorithms for solving randomized instances of MAPs with linear and bottleneck objectives that obtain solutions with guaranteed quality.

Original languageEnglish (US)
Pages (from-to)225-244
Number of pages20
JournalSpringer Proceedings in Mathematics and Statistics
Volume20
DOIs
StatePublished - Dec 1 2012
Externally publishedYes

Keywords

  • Hypergraph matching problem
  • Multidimensional assignment problem
  • Probabilistic analysis

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Computational studies of randomized multidimensional assignment problems'. Together they form a unique fingerprint.

  • Cite this