On the Hamming distance in combinatorial optimization problems on hypergraph matchings

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

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

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

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

zbMATH Keywords

multidimensional assignment problem

Mathematics Subject Classification ID

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

Cites Work

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

Cited In (9)

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

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)