Iterated Exact and Heuristic Algorithms for the Minimum Cost Bipartite Perfect Matching Problem with Conflict Constraints

被引：0
|
作者：
Oncan, T. [1 ]
Altinel, I. K. [2 ]
机构：
[1] Galatasaray Univ, Dept Ind Engn, Istanbul, Turkey
[2] Bogazici Univ, Dept Ind Engn, Istanbul, Turkey
来源：
2017 IEEE INTERNATIONAL CONFERENCE ON INDUSTRIAL ENGINEERING AND ENGINEERING MANAGEMENT (IEEM) | 2017年
关键词：
Bipartite perfect matching problem; conflict graph; assignment problem;
D O I：
暂无
中图分类号：
T [工业技术];
学科分类号：
08 ;
摘要：
In this study we address the Minimum Cost Bipartite Perfect Matching Problem with Conflict Pair Constraints (MCBPMPC) on bipartite graphs. Given a cost attached to each edge, the MCBPMPC is to find a minimum cost perfect matching on a bipartite graph such that at most one edge is chosen from a set of conflicting edge pairs. Two formulations, specially tailored iterated exact and heuristic algorithms are introduced. Computational experiments are performed on randomly generated instances. According to the extensive experiments, the iterated exact algorithm yields promising performance.
引用
收藏
页码：1032 / 1036
页数：5
相关论文
共 50 条
  • [1] The minimum cost perfect matching problem with conflict pair constraints
    Oncan, Temel
    Zhang, Ruonan
    Punnen, Abraham P.
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2013, 40 (04) : 920 - 930
  • [2] Computational comparison of several greedy algorithms for the minimum cost perfect matching problem on large graphs
    Wohlk, Sanne
    Laporte, Gilbert
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2017, 87 : 107 - 113
  • [3] A Faster Algorithm for Minimum-cost Bipartite Perfect Matching in Planar Graphs
    Asathulla, Mudabir Kabir
    Khanna, Sanjeev
    Lahn, Nathaniel
    Raghvendra, Sharath
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (01)
  • [4] A Faster Algorithm for Minimum-Cost Bipartite Perfect Matching in Planar Graphs
    Asathulla, Mudabir Kabir
    Khanna, Sanjeev
    Lahn, Nathaniel
    Raghvendra, Sharath
    [J]. SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 457 - 476
  • [5] On the bipartite unique perfect matching problem
    Hoang, Thanh Minh
    Mahajan, Meena
    Thierauf, Thomas
    [J]. AUTOMATA, LANGUAGES AND PROGRAMMING, PT 1, 2006, 4051 : 453 - 464
  • [6] Exact and heuristic algorithms for solving the generalized minimum filter placement problem
    Mofya, E. Chisonge
    Smith, J. Cole
    [J]. JOURNAL OF COMBINATORIAL OPTIMIZATION, 2006, 12 (03) : 231 - 256
  • [7] Exact and heuristic algorithms for solving the generalized minimum filter placement problem
    E. Chisonge Mofya
    J. Cole Smith
    [J]. Journal of Combinatorial Optimization, 2006, 12 : 231 - 256
  • [8] Maximum weight perfect matching problem with additional disjunctive conflict constraints
    Akyuz, M. Hakan
    Altinel, I. Kuban
    Oncan, Temel
    [J]. NETWORKS, 2023, 81 (04) : 465 - 489
  • [9] The biobjective minimum-cost perfect matching problem and Chinese postman problem
    Pozo, Miguel A.
    Puerto, Justo
    Roldan, Ignacio
    [J]. INTERNATIONAL TRANSACTIONS IN OPERATIONAL RESEARCH, 2024, 31 (05) : 2988 - 3009
  • [10] Exact algorithms for the minimum cost vertex blocker clique problem
    Nasirian, Farzaneh
    Pajouh, Foad Mandavi
    Namayanja, Josephine
    [J]. COMPUTERS & OPERATIONS RESEARCH, 2019, 103 : 296 - 309
12345