A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs |
scientific article |
Statements
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (English)
0 references
21 June 2019
0 references
clique partitioning
0 references
max point tolerance graphs
0 references
column generation
0 references
branch-and-price
0 references
computational biology
0 references
loss of heterozygosity
0 references
0 references
0 references
