CP-Lib: Benchmark Instances of the Clique Partitioning Problem

被引：0
作者：
Sorensen, Michael M. [1 ]
Letchford, Adam N. [2 ]
机构：
[1] Aarhus Univ, Dept Econ & Business Econ, Fuglesangs Alle 4, DK-8210 Aarhus V, Denmark
[2] Univ Lancaster, Dept Management Sci, Bailrigg Campus, Lancaster LA1 4YX, England
来源：
MATHEMATICAL PROGRAMMING COMPUTATION | 2024年 / 16卷 / 01期
关键词：
Clique partitioning problem; Combinatorial optimisation; 90-11; COMPONENT GROUP FORMATION; GROUP-TECHNOLOGY; MACHINE; ALGORITHM; FACETS;
D O I：
10.1007/s12532-023-00249-1
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
The Clique Partitioning Problem is a fundamental and much-studied NP-hard combinatorial optimisation problem, with many applications. Several families of benchmark instances have been created in the past, but they are scattered across the literature and hard to find. To remedy this situation, we present CP-Lib, an online resource that contains most of the known instances, plus some challenging new ones.
引用
收藏
页码：93 / 111
页数：19
相关论文
共 54 条
[1]  
Ali H. H., 1993, Journal of Combinatorial Mathematics and Combinatorial Computing, V14, P15
[2]  
[Anonymous], 1991, J. Oper. Manage.
[3]   Correlation clustering [J].
Bansal, N ;
Blum, A ;
Chawla, S .
MACHINE LEARNING, 2004, 56 (1-3) :89-113
[4]  
BEASLEY JE, 1990, J OPER RES SOC, V41, P1069, DOI 10.2307/2582903
[5]   A LINEAR FORMULATION OF THE MACHINE-PART CELL-FORMATION PROBLEM [J].
BOCTOR, FF .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (02) :343-356
[6]   A CLOSE NEIGHBOR ALGORITHM FOR DESIGNING CELLULAR MANUFACTURING SYSTEMS [J].
BOE, WJ ;
CHENG, CH .
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 1991, 29 (10) :2097-2116
[7]   Exact Algorithms for Cluster Editing: Evaluation and Experiments [J].
Boecker, Sebastian ;
Briesemeister, Sebastian ;
Klau, Gunnar W. .
ALGORITHMICA, 2011, 60 (02) :316-334
[8]   Solving the clique partitioning problem as a maximally diverse grouping problem [J].
Brimberg, Jack ;
Janicijevic, Stefana ;
Mladenovic, Nenad ;
Urosevic, Dragan .
OPTIMIZATION LETTERS, 2017, 11 (06) :1123-1135
[9]  
Bruckner Sharon, 2013, Experimental Algorithms 12th International Symposium, SEA 2013. Proceedings, P176, DOI 10.1007/978-3-642-38527-8_17
[10]   A branch-and-cut algorithm for the equicut problem [J].
Brunetta, L ;
Conforti, M ;
Rinaldi, G .
MATHEMATICAL PROGRAMMING, 1997, 78 (02) :243-263
123456