Exact clustering via integer programming and maximum satisfiability
We consider the following general graph clustering problem: given a complete undirected
graph G=(V, E, c) with an edge weight function c: E-> Q, we are asked to find a partition C of …
graph G=(V, E, c) with an edge weight function c: E-> Q, we are asked to find a partition C of …
Solving clique partitioning problems: A comparison of models and commercial solvers
Finding good solutions to clique partitioning problems remains a computational challenge.
With rare exceptions, finding optimal solutions for all but small instances is not practically …
With rare exceptions, finding optimal solutions for all but small instances is not practically …
Colorful path detection in vertex-colored temporal
R Dondi, MM Hosseinzadeh - Network Science, 2023 - cambridge.org
Finding paths is a fundamental problem in graph theory and algorithm design due to its
many applications. Recently, this problem has been considered on temporal graphs, where …
many applications. Recently, this problem has been considered on temporal graphs, where …
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 …
Multi-sentence compression with word vertex-labeled graphs and integer linear programming
Multi-Sentence Compression (MSC) aims to generate a short sentence with key information
from a cluster of closely related sentences. MSC enables summarization and question …
from a cluster of closely related sentences. MSC enables summarization and question …
Tropical paths in vertex-colored graphs
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color
of the initial graph. In this work we study the problem of finding tropical paths in vertex …
of the initial graph. In this work we study the problem of finding tropical paths in vertex …
Connected tropical subgraphs in vertex-colored graphs
JAA d'Auriac, N Cohen, H El Mafthoui… - Discrete …, 2016 - dmtcs.episciences.org
A subgraph of a vertex-colored graph is said to be tropical whenever it contains each color
of the graph. In this work we study the problem of finding a minimal connected tropical …
of the graph. In this work we study the problem of finding a minimal connected tropical …
Branch-and-cut algorithms for colorful components problems
We tackle three optimization problems in which a colored graph, where each node is
assigned a color, must be partitioned into colorful connected components. A component is …
assigned a color, must be partitioned into colorful connected components. A component is …
Algorithmic and hardness results for the colorful components problems
A Adamaszek, A Popa - Algorithmica, 2015 - Springer
In this paper we investigate the colorful components framework, motivated by applications
emerging from comparative genomics. The general goal is to remove a collection of edges …
emerging from comparative genomics. The general goal is to remove a collection of edges …