On the Hamming distance in combinatorial optimization problems on hypergraph matchings

DOI10.1007/S11590-010-0187-9zbMATH Open1202.90227OpenAlexW2069333208MaRDI QIDQ601985FDOQ601985

Authors Pavlo A. Krokhmal, Panos M. Pardalos, A. R. Kammerdiner

Publication date 29 October 2010

Published in Optimization Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s11590-010-0187-9

zbMATH Keywords

multidimensional assignment problem

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Discrete location and assignment (90B80)

Recommendations

• Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions
• On the Hamming distance of constraint satisfaction problems.
• Computational studies of randomized multidimensional assignment problems
• Some inverse optimization problems under the Hamming distance
• The distance approach to approximate combinatorial counting

Cites work

• scientific article; zbMATH DE number 6118218 (Why is no real title available?)
• scientific article; zbMATH DE number 3983158 (Why is no real title available?)
• scientific article; zbMATH DE number 43754 (Why is no real title available?)
• A shortest augmenting path algorithm for dense and sparse linear assignment problems
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Landscapes and their correlation functions
• Letter to the Editor—The Multidimensional Assignment Problem
• Nonlinear assignment problems. Algorithms and applications
• Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
• Selected topics on assignment problems
• The quadratic three-dimensional assignment problem: exact and approximate solution methods

Cited in

(9)

• Minimum Partial-Matching and Hausdorff RMS-Distance under Translation: Combinatorics and Algorithms
• scientific article; zbMATH DE number 6292622 (Why is no real title available?)
• scientific article; zbMATH DE number 7650314 (Why is no real title available?)
• On the canonical metric representation, average distance, and partial Hamming graphs
• Distance Labelling Problems for Hypercubes and Hamming Graphs – A Survey
• Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem
• Mallows and generalized Mallows model for matchings
• Hamming distance between the strings generated by adjacency matrix of a subgraph complementary graph and their sum
• Characteristics of the Distribution of Hamming Distance Values Between Multidimensional Assignment Problem Solutions

This page was built for publication: On the Hamming distance in combinatorial optimization problems on hypergraph matchings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q601985)