CP-Lib: Benchmark Instances of the Clique Partitioning Problem
MM Sørensen, AN Letchford - Mathematical Programming Computation, 2024 - Springer
Abstract The Clique Partitioning Problem is a fundamental and much-studied NP-hard
combinatorial optimisation problem, with many applications. Several families of benchmark …
combinatorial optimisation problem, with many applications. Several families of benchmark …
Concise integer linear programming formulation for clique partitioning problems
M Koshimura, E Watanabe, Y Sakurai, M Yokoo - Constraints, 2022 - Springer
Abstract A Clique Partitioning Problem (CPP) finds an optimal partition of a given edge-
weighted undirected graph, such that the sum of the weights is maximized. This general …
weighted undirected graph, such that the sum of the weights is maximized. This general …
[图书][B] A Divide-and-Conquer Approach to Employee Scheduling
N Heutte - 2020 - search.proquest.com
As companies grow larger and larger, it becomes necessary to determine the work
schedules of a large number of employees. Moreover, laws and labor agreements grow …
schedules of a large number of employees. Moreover, laws and labor agreements grow …