Sciweavers

Share
OL
2010

On the Hamming distance in combinatorial optimization problems on hypergraph matchings

11 years 3 months ago
On the Hamming distance in combinatorial optimization problems on hypergraph matchings
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.
Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. P
Added 29 Jan 2011
Updated 29 Jan 2011
Type Journal
Year 2010
Where OL
Authors Alla R. Kammerdiner, Pavlo A. Krokhmal, Panos M. Pardalos
Comments (0)
books