On the Hamming distance in combinatorial optimization problems on hypergraph matchings

Alla Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos

Research output: Contribution to journalArticle

4 Scopus citations

Abstract

In this note we consider the properties of the Hamming distance in combinatorial optimization problems on hypergraph matchings, also known as multidimensional assignment problems. It is shown that the Hamming distance between feasible solutions of hypergraph matching problems can be computed as an optimal value of linear assignment problem. For random hypergraph matching problems, an upper bound on the expected Hamming distance to the optimal solution is derived, and an exact expression is obtained in the special case of multidimensional assignment problems with 2 elements in each dimension.

Original languageEnglish (US)
Pages (from-to)609-617
Number of pages9
JournalOptimization Letters
Volume4
Issue number4
DOIs
StatePublished - Apr 6 2010
Externally publishedYes

Keywords

  • Combinatorial optimization
  • Hamming distance
  • Hypergraph matchings
  • Multidimensional assignment problem

ASJC Scopus subject areas

  • Control and Optimization

Fingerprint Dive into the research topics of 'On the Hamming distance in combinatorial optimization problems on hypergraph matchings'. Together they form a unique fingerprint.

Cite this