The minimum cost perfect matching problem with conflict pair constraints

• DOI: 10.1016/j.cor.2012.10.022
• Publication Date: 2012-11-17T02:30:47Z
• Authors: Temel Öncan; Ruonan Zhang; Abraham P. Punnen
• Keywords: 0211 other engineering and technologies; 02 engineering and technology

In this paper we address the minimum cost perfect matching problem with conflict pair constraints (MCPMPC). Given an undirected graph G with a cost associated with each edge and a conflict set of pairs of edges, the MCPMPC is to find a perfect matching with the lowest total cost such that no more than one edge is selected from each pair in the conflict set. MCPMPC is known to be strongly NP-hard. We present additional complexity results and identify new polynomially solvable cases for the general MCPMPC. Several heuristic algorithms and lower bounding schemes are presented. The proposed algorithms are tested on randomly generated instances. Encouraging experimental results are also reported.