{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:20:44Z","timestamp":1787318444273,"version":"build-2736575974"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642135194","type":"print"},{"value":"9783642135200","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13520-0_14","type":"book-chapter","created":{"date-parts":[[2010,6,12]],"date-time":"2010-06-12T12:10:33Z","timestamp":1276344633000},"page":"102-116","source":"Crossref","is-referenced-by-count":48,"title":["Solving Connected Subgraph Problems in Wildlife Conservation"],"prefix":"10.1007","author":[{"given":"Bistra","family":"Dilkina","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Carla P.","family":"Gomes","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J. Benders","year":"1962","unstructured":"Benders, J.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1007\/978-3-540-72397-4_2","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"J. Conrad","year":"2007","unstructured":"Conrad, J., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.: Connections in networks: Hardness of feasibility versus optimality. In: Van Hentenryck, P., Wolsey, L.A. (eds.) CPAIOR 2007. LNCS, vol.\u00a04510, pp. 16\u201328. Springer, Heidelberg (2007)"},{"issue":"2","key":"14_CR3","first-page":"99","volume":"4","author":"A.M. Costa","year":"2006","unstructured":"Costa, A.M., Cordeau, J.-F., Laporte, G.: Steiner tree problems with profits. INFOR: Information Systems and Operational Research\u00a04(2), 99\u2013115 (2006)","journal-title":"INFOR: Information Systems and Operational Research"},{"issue":"2","key":"14_CR4","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1002\/net.20274","volume":"53","author":"A.M. Costa","year":"2009","unstructured":"Costa, A.M., Cordeau, J.-F., Laporte, G.: Models and branch-and-cut algorithms for the steiner tree problem with revenues, budget and hop constraints. Networks\u00a053(2), 141\u2013159 (2009)","journal-title":"Networks"},{"issue":"4","key":"14_CR5","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1287\/opre.2.4.393","volume":"2","author":"G. Dantzig","year":"1954","unstructured":"Dantzig, G., Fulkerson, R., Johnson, S.: Solution of a Large-Scale Traveling-Salesman Problem. Operations Research\u00a02(4), 393\u2013410 (1954)","journal-title":"Operations Research"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","volume-title":"Automata, Languages and Programming","author":"E.D. Demaine","year":"2009","unstructured":"Demaine, E.D., Hajiaghayi, M.T., Klein, P.: Node-weighted steiner tree and group steiner tree in planar graphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol.\u00a05555. Springer, Heidelberg (2009)"},{"key":"14_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68155-7_27","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"C.P. Gomes","year":"2008","unstructured":"Gomes, C.P., van Hoeve, W.-J., Sabharwal, A.: Connections in networks: A hybrid approach. In: Perron, L., Trick, M.A. (eds.) CPAIOR 2008. LNCS, vol.\u00a05015, pp. 303\u2013307. Springer, Heidelberg (2008)"},{"key":"14_CR8","unstructured":"ILOG, SA, CPLEX 11.0 Reference Manual (2007)"},{"issue":"8","key":"14_CR9","doi-asserted-by":"publisher","first-page":"817","DOI":"10.1002\/(SICI)1520-6750(199812)45:8<817::AID-NAV4>3.0.CO;2-1","volume":"45","author":"H.F. Lee","year":"1998","unstructured":"Lee, H.F., Dooly, D.R.: Decomposition algorithms for the maximum-weight connected graph problem. Naval Research Logistics\u00a045(8), 817\u2013837 (1998)","journal-title":"Naval Research Logistics"},{"issue":"4","key":"14_CR10","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1016\/j.orl.2003.11.002","volume":"32","author":"A. Levin","year":"2004","unstructured":"Levin, A.: A better approximation algorithm for the budget prize collecting tree problem. Operations Research Letters\u00a032(4), 316\u2013319 (2004)","journal-title":"Operations Research Letters"},{"key":"14_CR11","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: Solving the prize-collecting steiner tree problem to optimality. In: ALENEX\/ANALCO, pp. 68\u201376 (2005)"},{"issue":"3","key":"14_CR12","doi-asserted-by":"publisher","first-page":"312","DOI":"10.1287\/mnsc.24.3.312","volume":"24","author":"D. McDaniel","year":"1977","unstructured":"McDaniel, D., Devine, M.: A Modified Benders\u2019 Partitioning Algorithm for Mixed Integer Programming. Management Science\u00a024(3), 312\u2013319 (1977)","journal-title":"Management Science"},{"issue":"2","key":"14_CR13","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1137\/S0097539702420474","volume":"37","author":"A. Moss","year":"2007","unstructured":"Moss, A., Rabani, Y.: Approximation algorithms for constrained node weighted steiner tree problems. SIAM J. Comput.\u00a037(2), 460\u2013481 (2007)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"14_CR14","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/s10666-005-9003-9","volume":"10","author":"J.C. Williams","year":"2005","unstructured":"Williams, J.C., Snyder, S.A.: Restoring habitat corridors in fragmented landscapes using optimization and percolation models. Environmental Modeling and Assessment\u00a010(3), 239\u2013250 (2005)","journal-title":"Environmental Modeling and Assessment"}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13520-0_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,30]],"date-time":"2021-04-30T08:06:03Z","timestamp":1619769963000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13520-0_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642135194","9783642135200"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13520-0_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}