On the Hamming distance in combinatorial optimization problems on hypergraph matchings
From MaRDI portal
Publication:601985
DOI10.1007/s11590-010-0187-9zbMath1202.90227OpenAlexW2069333208MaRDI QIDQ601985
Panos M. Pardalos, Pavlo A. Krokhmal, Alla 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
Related Items
Application of graph-theoretic approaches to the random landscapes of the three-dimensional assignment problem, Mallows and generalized Mallows model for matchings
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Selected topics on assignment problems
- Correlated and uncorrelated fitness landscapes and how to tell the difference
- A shortest augmenting path algorithm for dense and sparse linear assignment problems
- Landscapes and their correlation functions
- Nonlinear assignment problems. Algorithms and applications
- The quadratic three-dimensional assignment problem: exact and approximate solution methods
- Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
- Letter to the Editor—The Multidimensional Assignment Problem