A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs

DOI10.1007/s10288-018-0377-3zbMath1426.90221OpenAlexW2805119909MaRDI QIDQ2423295

Daniele Catanzaro, Luciano Porretta, Bjarni V. Halldórsson, Bernard Fortz

Publication date: 21 June 2019

Published in: 4OR (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10288-018-0377-3

zbMATH Keywords

column generationcomputational biologybranch-and-priceclique partitioningloss of heterozygositymax point tolerance graphs

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Combinatorial optimization (90C27)

Uses Software

• SCIP
• MersenneTwister

Cites Work

• Wilcoxon-Mann-Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules
• Max point-tolerance graphs
• SCIP: solving constraint integer programs
• Interval graphs and interval orders
• Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
• A recognition algorithm for the intersection graphs of paths in trees
• Algorithmic graph theory and perfect graphs
• Incidence matrices and interval graphs
• Clique partitioning of interval graphs with submodular costs on the cliques
• Vertex Intersection Graphs of Paths on a Grid
• The pure parsimony haplotyping problem: overview and computational advances
• Max-tolerance graphs as intersection graphs
• Mersenne twister
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs