{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,8,29]],"date-time":"2024-08-29T21:13:55Z","timestamp":1724966035819},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,2,13]],"date-time":"2011-02-13T00:00:00Z","timestamp":1297555200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2012,4]]},"DOI":"10.1007\/s11590-011-0289-z","type":"journal-article","created":{"date-parts":[[2011,2,12]],"date-time":"2011-02-12T00:29:31Z","timestamp":1297470571000},"page":"641-653","source":"Crossref","is-referenced-by-count":3,"title":["Exact and heuristic approaches for the set cover with pairs problem"],"prefix":"10.1007","volume":"6","author":[{"given":"Luciana Brugiolo","family":"Gon\u00e7alves","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Simone","family":"de Lima Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luiz Satoru","family":"Ochi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2011,2,13]]},"reference":[{"issue":"11","key":"289_CR1","doi-asserted-by":"crossref","first-page":"1069","DOI":"10.1057\/jors.1990.166","volume":"41","author":"J. Beasley","year":"1990","unstructured":"Beasley J.: OR-Library: distributing test problems by electronic mail. J. Oper. Res. Soc. 41(11), 1069\u20131072 (1990)","journal-title":"J. Oper. Res. Soc."},{"issue":"5","key":"289_CR2","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1016\/j.camwa.2006.12.095","volume":"55","author":"P. Bertolazzi","year":"2008","unstructured":"Bertolazzi P., Godi A., Labb\u00e9 M., Tininini L.: Solving haplotyping inference parsimony problem using a new basic polynomial formulation. Comput. Math. Appl. 55(5), 900\u2013911 (2008). doi: 10.1016\/j.camwa.2006.12.095","journal-title":"Comput. Math. Appl."},{"key":"289_CR3","unstructured":"Breslau, L., Diakonikolas, I., Duffield, N.G., Gu, Y., Hajiaghayi, M., Johnson, D.S., Karloff, H., Resende, M.G.C., Sen, S., Towsley, D.: Optimal node placement for path disjoint network monitoring. Tech. rep., AT&T Labs Research, NJ, USA (2007)"},{"key":"289_CR4","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TCBB.2006.24","volume":"3","author":"D.G. Brown","year":"2006","unstructured":"Brown D.G., Harrower I.M.: Integer programming approaches to haplotype inference by pure parsimony. IEEE\/ACM Trans. Comput. Biol. Bioinform. 3, 141\u2013154 (2006). doi: 10.1109\/TCBB.2006.24","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"issue":"5","key":"289_CR5","doi-asserted-by":"crossref","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.: The pure parsimony haplotyping problem: overview and computational advances. Int. Trans. Oper. Res. 16(5), 561\u2013584 (2009)","journal-title":"Int. Trans. Oper. Res."},{"key":"289_CR6","doi-asserted-by":"crossref","first-page":"S128","DOI":"10.1093\/bioinformatics\/18.suppl_1.S128","volume":"18","author":"R.J. Fernandes","year":"2002","unstructured":"Fernandes R.J., Skiena S.S.: Microarray synthesis through multiple-use PCR primer design. Bioinformatics 18, S128\u2013S135 (2002)","journal-title":"Bioinformatics"},{"key":"289_CR7","volume-title":"Computers and Intractability; A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey M.R., Johnson D.S.: Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"289_CR8","doi-asserted-by":"crossref","first-page":"739","DOI":"10.1111\/j.1475-3995.2010.00768.x","volume":"17","author":"L.B. Gon\u00e7alves","year":"2010","unstructured":"Gon\u00e7alves L.B., Martins S.L., Ochi L.S.: Effective heuristics for the set covering with pairs problem. Int. Trans. Oper. Res. 17, 739\u2013751 (2010)","journal-title":"Int. Trans. Oper. Res."},{"key":"289_CR9","doi-asserted-by":"crossref","unstructured":"Gusfield, D.: Haplotype inference by pure parsimony. In: Combinatorial Pattern Matching. Lecture Notes in Computer Science, vol. 2676, pp. 144\u2013155. Springer, Berlin\/Heidelberg (2003)","DOI":"10.1007\/3-540-44888-8_11"},{"key":"289_CR10","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Jain, K., Lau, L.C., Mandoiu, I.I., Russell, A., Vazirani, V.V.: Minimum multicolored subgraph problem in multiplex PCR primer set selection and population haplotyping. In: Proceedings of the 6th International Conference on Computational Science (ICCS), pp. 758\u2013766 (2006)","DOI":"10.1007\/11758525_102"},{"key":"289_CR11","doi-asserted-by":"crossref","unstructured":"Hassin, R., Segev, D.: The set cover with pairs problem. In: FSTTCS 2005: Proceedings of the 25th International Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 3821, pp. 164\u2013176. Springer, Berlin\/Heidelberg, Lecture Notes in Computer Science (2005)","DOI":"10.1007\/11590156_13"},{"key":"289_CR12","doi-asserted-by":"crossref","first-page":"1303","DOI":"10.1016\/j.ic.2008.06.002","volume":"206","author":"D. Hermelin","year":"2008","unstructured":"Hermelin D., Rawitz D., Rizzi R., Vialette S.: The minimum substring cover problem. Inform. Comput. 206, 1303\u20131312 (2008)","journal-title":"Inform. Comput."},{"key":"289_CR13","unstructured":"Ilog, Inc.: Solver CPLEX 11.2, ILOG Concert Technolog (2009). http:\/\/www.ilog.com\/products\/cplex\/ . Accessed 15 May 2009"},{"key":"289_CR14","first-page":"169","volume-title":"Network Design: Connectivity and Facilities Location DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 40","author":"M. Karpinski","year":"1998","unstructured":"Karpinski M., Zelikovsky A.: Approximating dense cases of covering problems. In: Pardalos, P.M., Du, D. (eds.) Network Design: Connectivity and Facilities Location DIMACS Series in Discrete Mathematics and Theoretical Computer Science, vol. 40, pp. 169\u2013178. American Mathematical Society, Providence, RI (1998)"},{"issue":"4","key":"289_CR15","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1287\/ijoc.1040.0085","volume":"16","author":"G. Lancia","year":"2004","unstructured":"Lancia G., Pinotti M.C., Rizzi R.: Haplotyping populations by pure parsimony: Complexity of exact and approximation algorithms. INFORMS J Computing 16(4), 348\u2013359 (2004). doi: 10.1287\/ijoc.1040.0085","journal-title":"INFORMS J Computing"},{"key":"289_CR16","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/0-306-48056-5_11","volume-title":"Handbook of Metaheuristics, vol. 57","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o H.R., Martin O.C., St\u00fctzle T.: Iterated local search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, vol. 57, pp. 320\u2013353. Springer\/Kluwer Academic Publishers, New York (2003)"},{"issue":"11","key":"289_CR17","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A. Subramanian","year":"2010","unstructured":"Subramanian A., Drummond L.M., Bentes C., Ochi L.S., Farias R.: A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput. Oper. Res. 37(11), 1899\u20131911 (2010)","journal-title":"Comput. Oper. Res."},{"key":"289_CR18","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1007\/978-1-4613-0303-9_9","volume-title":"Handbook of Combinatorial Optimization, vol 1","author":"R. Vemuganti","year":"1998","unstructured":"Vemuganti R.: Applications of set covering, set packing and set partitioning modes: a survey. In: Pardalos, P.M., Du, D. (eds.) Handbook of Combinatorial Optimization, vol 1, pp. 573\u2013746. Kluwer Academic Publishers, New York (1998)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0289-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11590-011-0289-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-011-0289-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T10:24:17Z","timestamp":1559989457000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11590-011-0289-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,2,13]]},"references-count":18,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,4]]}},"alternative-id":["289"],"URL":"https:\/\/doi.org\/10.1007\/s11590-011-0289-z","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"value":"1862-4472","type":"print"},{"value":"1862-4480","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,2,13]]}}}