On the Hamming distance in combinatorial optimization problems on hypergraph matchings
type: Item
instance of: scholarly article
title: On the Hamming distance in combinatorial optimization problems on hypergraph matchings
zbMATH Open document ID: 1202.90227
author: Pavlo A. Krokhmal
author: Panos M. Pardalos
author: A. R. Kammerdiner
published in: Optimization Letters
publication date: 2010-10-29T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 5808661
zbMATH Keywords: multidimensional assignment problem
MaRDI profile type: Publication
full work available at URL: s11590-010-0187-9
OpenAlex ID: W2069333208
cites work: Correlated and uncorrelated fitness landscapes and how to tell the difference
cites work: Landscapes and their correlation functions
cites work: Nonlinear assignment problems. Algorithms and applications
cites work: Selected topics on assignment problems
cites work: Q3993087
cites work: Letter to the Editor—The Multidimensional Assignment Problem
cites work: Q3145800
cites work: The quadratic three-dimensional assignment problem: exact and approximate solution methods
cites work: Primal-Dual Distance Bounds of Linear Codes With Application to Cryptography
cites work: Q3748279
cites work: A shortest augmenting path algorithm for dense and sparse linear assignment problems
DOI: 10.1007/S11590-010-0187-9
description: scientific article; zbMATH DE number 5808661