On the Hamming distance in combinatorial optimization problems on hypergraph matchings

被引：0
|
作者：
Alla Kammerdiner
Pavlo A. Krokhmal
Panos M. Pardalos
机构：
[1] AFRL/RWGN-NRC,Department of Mechanical and Industrial Engineering
[2] University of Iowa,Department of Industrial and Systems Engineering, Center for Applied Optimization
[3] University of Florida,undefined
来源：
Optimization Letters | 2010年 / 4卷
关键词：
Hypergraph matchings; Combinatorial optimization; Multidimensional assignment problem; Hamming distance;
D O I：
暂无
中图分类号：
学科分类号：
摘要：
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.
引用
收藏
页码：609 / 617
页数：8
相关论文
共 50 条
  • [1] On the Hamming distance in combinatorial optimization problems on hypergraph matchings
    Kammerdiner, Alla
    Krokhmal, Pavlo A.
    Pardalos, Panos M.
    [J]. OPTIMIZATION LETTERS, 2010, 4 (04) : 609 - 617
  • [2] Some inverse optimization problems under the Hamming distance
    Duin, CW
    Volgenant, A
    [J]. EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2006, 170 (03) : 887 - 899
  • [3] Pseudorandom hypergraph matchings
    Ehard, Stefan
    Glock, Stefan
    Joos, Felix
    [J]. COMBINATORICS PROBABILITY AND COMPUTING, 2020, 29 (06) : 868 - 885
  • [4] On the Hamming distance of constraint satisfaction problems
    Crescenzi, P
    Rossi, G
    [J]. THEORETICAL COMPUTER SCIENCE, 2002, 288 (01) : 85 - 100
  • [5] Constrained and bicriteria inverse bottleneck optimization problems under weighted Hamming distance
    Guan, Xiucui
    Cao, Yangbo
    [J]. OPTIMIZATION, 2012, 61 (02) : 129 - 142
  • [6] A Class of Constrained Inverse Bottleneck Optimization Problems under Weighted Hamming Distance
    Cao, Yangbo
    Guan, Xiucui
    [J]. INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION, VOL 2, PROCEEDINGS, 2009, : 859 - 863
  • [7] SOME NEW RESULTS ON INVERSE/REVERSE OPTIMIZATION PROBLEMS UNDER THE WEIGHTED HAMMING DISTANCE
    Liu, Longcheng
    Chen, Yong
    Wu, Biao
    Yao, Enyu
    [J]. PACIFIC JOURNAL OF OPTIMIZATION, 2015, 11 (04): : 593 - 603
  • [8] Representation of the Greedy Algorithms Applicability for Solving the Combinatorial Optimization Problems Based on the Hypergraph Mathematical Structure
    Potebnia, Artem
    [J]. 2017 14TH INTERNATIONAL CONFERENCE: THE EXPERIENCE OF DESIGNING AND APPLICATION OF CAD SYSTEMS IN MICROELECTRONICS (CADSM), 2017, : 328 - 332
  • [9] ON COMBINATORIAL OPTIMIZATION PROBLEMS
    Sharifov, F. A.
    [J]. PROCEEDINGS OF THE7TH INTERNATIONAL CONFERENCE ON CONTROL AND OPTIMIZATION WITH INDUSTRIAL APPLICATIONS, VOL. 1, 2020, : 377 - 379
  • [10] The Complexity Classes of Hamming Distance Recoverable Robust Problems
    Gruene, Christoph
    [J]. LATIN 2024: THEORETICAL INFORMATICS, PT I, 2024, 14578 : 321 - 335
12345