{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:44:47Z","timestamp":1740141887031,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T00:00:00Z","timestamp":1528329600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2019,3]]},"DOI":"10.1007\/s10288-018-0377-3","type":"journal-article","created":{"date-parts":[[2018,6,7]],"date-time":"2018-06-07T11:06:44Z","timestamp":1528369604000},"page":"75-96","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Branch & Price algorithm for the minimum cost clique cover problem in max-point tolerance graphs"],"prefix":"10.1007","volume":"17","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-6360-8070","authenticated-orcid":false,"given":"Luciano","family":"Porretta","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9427-1562","authenticated-orcid":false,"given":"Daniele","family":"Catanzaro","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0756-0767","authenticated-orcid":false,"given":"Bjarni V.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2355-8926","authenticated-orcid":false,"given":"Bernard","family":"Fortz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,6,7]]},"reference":[{"issue":"1","key":"377_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s12532-008-0001-1","volume":"1","author":"T Achterberg","year":"2009","unstructured":"Achterberg T (2009) SCIP: solving constraint integer programs. Math Program Comput 1(1):1\u201341","journal-title":"Math Program Comput"},{"key":"377_CR2","doi-asserted-by":"publisher","first-page":"129","DOI":"10.7155\/jgaa.00253","volume":"16","author":"A Asinowski","year":"2012","unstructured":"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\u2013150","journal-title":"J Graph Algorithms Appl"},{"issue":"3","key":"377_CR3","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/S0022-0000(76)80045-1","volume":"13","author":"KS Booth","year":"1976","unstructured":"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\u2013379","journal-title":"J Comput Syst Sci"},{"issue":"5","key":"377_CR4","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1111\/j.1475-3995.2009.00716.x","volume":"16","author":"D Catanzaro","year":"2009","unstructured":"Catanzaro D, Labb\u00e9 M (2009) The pure parsimony haplotyping problem: overview and computational advances. Int Trans Oper Res 16(5):561\u2013584","journal-title":"Int Trans Oper Res"},{"issue":"6","key":"377_CR5","doi-asserted-by":"publisher","first-page":"1391","DOI":"10.1109\/TCBB.2012.138","volume":"10","author":"D Catanzaro","year":"2013","unstructured":"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\u20131402","journal-title":"IEEE\/ACM Trans Comput Biol Bioinform"},{"issue":"1","key":"377_CR6","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.dam.2015.08.019","volume":"216","author":"D Catanzaro","year":"2017","unstructured":"Catanzaro D, Chaplick S, Felsner S, Halld\u00f3rsson BV, Halld\u00f3rsson MM, Hixon T, Stacho J (2017) Max point-tolerance graphs. Discret Appl Math 216(1):84\u201397","journal-title":"Discret Appl Math"},{"issue":"1","key":"377_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1038\/ng1697","volume":"38","author":"DF Conrad","year":"2006","unstructured":"Conrad DF, Andrews TD, Carter NP, Hurles ME, Pritchard JK (2006) A high-resolution survey of deletion polymorphism in the human genome. Nat Genet 38(1):75\u201381","journal-title":"Nat Genet"},{"key":"377_CR8","volume-title":"Introduction to algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen TH, Leiserson CE, Rivest RL, Stein C (2009) Introduction to algorithms. The MIT Press, Cambridge"},{"key":"377_CR9","unstructured":"Corneil DG, Kamula PA (1987) Extensions of permutation and interval graphs. In: Proceedings of 18th southeastern conference on combinatorics, graph theory and computing, pp 267\u2013275"},{"key":"377_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-14279-6","volume-title":"Graph theory","author":"R Diestel","year":"2010","unstructured":"Diestel R (2010) Graph theory. Springer, Berlin"},{"key":"377_CR11","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1051\/ro:2007024","volume":"41","author":"G Dion","year":"2007","unstructured":"Dion G, Jost V, Queyranne M (2007) Clique partitioning of interval graphs with submodular costs on the cliques. RAIRO Oper Res 41:275\u2013287","journal-title":"RAIRO Oper Res"},{"key":"377_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1214\/09-SS051","volume":"4","author":"MP Fay","year":"2010","unstructured":"Fay MP, Proschan MA (2010) Wilcoxon\u2013Mann\u2013Whitney or t-test? On assumptions for hypothesis tests and multiple interpretations of decision rules. Stat Surv 4:1\u201339","journal-title":"Stat Surv"},{"key":"377_CR13","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(85)90042-1","volume-title":"Interval orders and interval graphs: a study of partially ordered sets","author":"P Fishburn","year":"1985","unstructured":"Fishburn P (1985) Interval orders and interval graphs: a study of partially ordered sets. Wiley, New York"},{"key":"377_CR14","unstructured":"Frank A (1976) Some polynomial algorithms for certain graphs and hypergraphs. In: Proceedings of the 5th British combinatorial conference (Aberdeen 1975), Congressus numerantium XV, pp 211\u2013226"},{"key":"377_CR15","doi-asserted-by":"publisher","first-page":"835","DOI":"10.2140\/pjm.1965.15.835","volume":"15","author":"DR Fulkerson","year":"1965","unstructured":"Fulkerson DR, Gross OA (1965) Incidence matrices and interval graphs. Pac J Math 15:835\u2013855","journal-title":"Pac J Math"},{"key":"377_CR16","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"MR Garey","year":"2003","unstructured":"Garey MR, Johnson DS (2003) Computers and intractability: a guide to the theory of NP-completeness. Freeman, New York"},{"key":"377_CR17","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1016\/0012-365X(78)90003-1","volume":"23","author":"F Gavril","year":"1978","unstructured":"Gavril F (1978) A recognition algorithm for the intersection graphs of paths in trees. Discret Math 23:211\u2013227","journal-title":"Discret Math"},{"key":"377_CR18","volume-title":"Algorithmic graph theory and perfect graphs","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC (2004) Algorithmic graph theory and perfect graphs. Elsevier, North-Holland"},{"key":"377_CR19","unstructured":"Golumbic MC, Monma CL (1982) A generalization of interval graphs with tolerances. Congressus Numerantium 35:321\u2013331. Proceedings of the 13th southeastern conference on combinatorics, graph theory and computing"},{"key":"377_CR20","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511542985","volume-title":"Tolerance graphs, Cambridge studies in advanced mathematics","author":"MC Golumbic","year":"2004","unstructured":"Golumbic MC, Trenk A (2004) Tolerance graphs, Cambridge studies in advanced mathematics, vol 89. Cambridge University Press, Cambridge"},{"issue":"3","key":"377_CR21","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1089\/cmb.2010.0288","volume":"18","author":"BV Halldorsson","year":"2011","unstructured":"Halldorsson BV, Aguiar D, Tarpine R, Istrail S (2011) The Clark phaseable sample size problem: long-range phasing and loss of heterozygosity in GWASlark phaseable sample size problem: long-range phasing and loss of heterozygosity in GWAS. J Comput Biol 18(3):323\u2013333","journal-title":"J Comput Biol"},{"key":"377_CR22","doi-asserted-by":"crossref","unstructured":"Kaufmann M, Kratochvil J, Lehmann K, Subramanian A (2006) Max-tolerance graphs as intersection graphs: cliques, cycles and recognition. In: Proceedings of 17th annual ACM-SIAM symposium on discrete algorithms SODA 06, SIAM, pp 832\u2013841","DOI":"10.1145\/1109557.1109649"},{"key":"377_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4615-4975-8","volume-title":"Large scale linear and integer optimization: a unified approach","author":"RK Martin","year":"1999","unstructured":"Martin RK (1999) Large scale linear and integer optimization: a unified approach. Springer, Berlin"},{"issue":"1","key":"377_CR24","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/272991.272995","volume":"8","author":"M Matsumoto","year":"1998","unstructured":"Matsumoto M, Nishimura T (1998) Mersenne twister: a 623-dimensionally equidistributed uniform pseudorandom number generator. ACM Trans Model Comput Simul 8(1):3\u201330","journal-title":"ACM Trans Model Comput Simul"},{"issue":"10","key":"377_CR25","doi-asserted-by":"publisher","first-page":"1166","DOI":"10.1038\/ng.238","volume":"40","author":"SA McCarroll","year":"2008","unstructured":"McCarroll SA, Kuruvilla FG, Korn JM, Cawley S, Nemesh J, Wysoker A, Shapero MH, de Bakker PIW, Maller JB, Kirby A, Elliott AL, Parkin M, Hubbell E, Webster T, Mei R, Veitch J, Collins PJ, Handsaker R, Lincoln S, Nizzari M, Blume J, Jones KW, Rava R, Daly MJ, Gabriel SB, Altshuler D (2008) Integrated detection and population-genetic analysis of snps and copy number variation. Nat Genet 40(10):1166\u20131174","journal-title":"Nat Genet"},{"key":"377_CR26","volume-title":"Handbooks in operations research and management science","author":"GL Nemhauser","year":"1989","unstructured":"Nemhauser GL, Wolsey LA (1989) Optimization. In: Nemhauser GL, Kan AHGR, Todd MJ (eds) Handbooks in operations research and management science. Elsevier, North-Holland"},{"key":"377_CR27","first-page":"354","volume-title":"Identification of deletion polymorphisms from haplotypes","author":"T Speed","year":"2007","unstructured":"Speed T, Huang H, Corona E, Raphael B, Eskin E (2007) Identification of deletion polymorphisms from haplotypes, vol 4453. Springer, Berlin, pp 354\u2013365"},{"key":"377_CR28","doi-asserted-by":"publisher","first-page":"232","DOI":"10.1038\/nature07229","volume":"455","author":"H Stefansson","year":"2008","unstructured":"Stefansson H, Rujescu D, Cichon S, Pietil\u00e4inen OPH, Ingason A, Steinberg S, Fossdal R, Sigurdsson E, Sigmundsson T, Buizer-Voskamp JE, Hansen T, Jakobsen KD, Muglia P, Francks C, Matthews PM, Gylfason A, Halldorsson BV, Gudbjartsson D, Thorgeirsson TE, Sigurdsson A, Jonasdottir A, Jonasdottir A, Bjornsson A, Mattiasdottir S, Blondal T, Haraldsson M, Magnusdottir BB, Giegling I, Moeller HJ, Hartmann A, Shianna KV, Ge D, Need AC, Crombie C, Fraser G, Walker N, Lonnqvist J, Suvisaari J, Tuulio-Henriksson A, Paunio T, Toulopoulou T, Bramon E, Forti MD, Murray R, Ruggeri M, Vassos E, Tosato S, Walshe M, Li T, Vasilescu C, Moehleisen TW, Wang AG, Ullum H, Djurovic S, Melle I, Olesen J, Kiemeney LA, Franke B, Sabatti C, Freimer NB, Gulcher JR, Thorsteinsdottir U, Kong A, Andreassen OA, Ophoff RA, Georgi A, Rietschel M, Werge T, Petursson H, Goldstein DB, N\u00f6then MM, Peltonen L, Collier DA, Clair DS, Stefansson K (2008) Large recurrent microdeletions associated with schizophrenia. Nature 455:232\u2013236","journal-title":"Nature"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0377-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-018-0377-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-018-0377-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T19:06:26Z","timestamp":1559847986000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-018-0377-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,6,7]]},"references-count":28,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2019,3]]}},"alternative-id":["377"],"URL":"https:\/\/doi.org\/10.1007\/s10288-018-0377-3","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"type":"print","value":"1619-4500"},{"type":"electronic","value":"1614-2411"}],"subject":[],"published":{"date-parts":[[2018,6,7]]},"assertion":[{"value":"15 June 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 June 2018","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}