A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs

Published:2018-06-07 Issue:1 Volume:17 Page:75-96
ISSN:1619-4500
Container-title:4OR
language:en
Short-container-title:4OR-Q J Oper Res

Author:

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

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Theoretical Computer Science,Management Information Systems,Management Science and Operations Research

Link

http://link.springer.com/content/pdf/10.1007/s10288-018-0377-3.pdf

Reference28 articles.

1. Achterberg T (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1):1–41

2. Asinowski A, Cohen E, Golumbic MC, Limouzy V, Lipshteyn M, Stern M (2012) Vertex intersection graphs of paths on a grid. J Graph Algorithms Appl 16:129–150

3. Booth KS, Lueker GS (1976) Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. J Comput Syst Sci 13(3):335–379

4. Catanzaro D, Labbé M (2009) The pure parsimony haplotyping problem: overview and computational advances. Int Trans Oper Res 16(5):561–584

5. Catanzaro D, Labbe M, Halldorsson BV (2013) An integer programming formulation of the parsimonious loss of heterozygosity problem. IEEE/ACM Trans Comput Biol Bioinform 10(6):1391–1402

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP