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.
- Combinatorial optimization
- Hamming distance
- Hypergraph matchings
- Multidimensional assignment problem
ASJC Scopus subject areas
- Business, Management and Accounting (miscellaneous)
- Control and Optimization