{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T10:14:43Z","timestamp":1746612883170,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642381706"},{"type":"electronic","value":"9783642381713"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38171-3_20","type":"book-chapter","created":{"date-parts":[[2013,4,11]],"date-time":"2013-04-11T01:30:36Z","timestamp":1365643836000},"page":"300-315","source":"Crossref","is-referenced-by-count":10,"title":["The Rooted Maximum Node-Weight Connected Subgraph Problem"],"prefix":"10.1007","author":[{"given":"Eduardo","family":"\u00c1lvarez-Miranda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ivana","family":"Ljubi\u0107","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petra","family":"Mutzel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","first-page":"1","volume":"1","author":"C. Backes","year":"2011","unstructured":"Backes, C., Rurainski, A., Klau, G., M\u00fcller, O., St\u00f6ckel, D., Gerasch, A., K\u00fcntzer, J., Maisel, D., Ludwig, N., Hein, M., Keller, A., Burtscher, H., Kaufmann, M., Meese, E., Lenhof, H.: An integer linear programming approach for finding deregulated subgraphs in regulatory networks. Nucleic Acids Research\u00a01, 1\u201313 (2011)","journal-title":"Nucleic Acids Research"},{"unstructured":"Carvajal, R., Constantino, M., Goycoolea, M., Vielma, J.P., Weintraub, A.: Imposing connectivity constraints in forest planning models (2011) (submitted)","key":"20_CR2"},{"unstructured":"Chen, S., Ljubi\u0107, I., Raghavan, S.: The generalized regenerator location problem (2012) (submitted)","key":"20_CR3"},{"issue":"1","key":"20_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.jeem.2011.08.001","volume":"63","author":"J.M. Conrad","year":"2012","unstructured":"Conrad, J.M., Gomes, C.P., van Hoeve, W.-J., Sabharwal, A., Suter, J.F.: Wildlife corridors as a connected subgraph problem. Journal of Environmental Economics and Management\u00a063(1), 1\u201318 (2012)","journal-title":"Journal of Environmental Economics and Management"},{"key":"20_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-642-13520-0_14","volume-title":"Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems","author":"B. Dilkina","year":"2010","unstructured":"Dilkina, B., Gomes, C.: Solving connected subgraph problems in wildlife conservation. In: Lodi, A., Milano, M., Toth, P. (eds.) CPAIOR 2010. LNCS, vol.\u00a06140, pp. 102\u2013116. Springer, Heidelberg (2010)"},{"unstructured":"Dilkina, B., Gomes, C.: Synthetic corridor problem generator (2012), \n                    http:\/\/www.cs.cornell.edu\/~bistra\/connectedsubgraph.htm","key":"20_CR6"},{"key":"20_CR7","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1093\/bioinformatics\/btn161","volume":"24","author":"M. Dittrich","year":"2008","unstructured":"Dittrich, M., Klau, G., Rosenwald, A., Dandekar, T., M\u00fcller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics\u00a024, i223\u2013i231 (2008)","journal-title":"Bioinformatics"},{"issue":"2","key":"20_CR8","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s00186-008-0223-z","volume":"68","author":"A. F\u00fcgenschuh","year":"2008","unstructured":"F\u00fcgenschuh, A., F\u00fcgenschuh, M.: Integer linear programming models for topology optimization in sheet metal design. Mathematical Methods of Operations Research\u00a068(2), 313\u2013331 (2008)","journal-title":"Mathematical Methods of Operations Research"},{"unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize-collecting Steiner tree problem: Theory and practice. In: Proc. 11th ACM-SIAM Symp. Discrete Algorithms, SODA 2000, San Francisco, USA, January 9-11, pp. 760\u2013769 (2000)","key":"20_CR9"},{"issue":"1-2","key":"20_CR10","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s10107-010-0359-5","volume":"124","author":"K. Kaparis","year":"2010","unstructured":"Kaparis, K., Letchford, A.N.: Separation algorithms for 0-1 knapsack polytopes. Mathematical Programming\u00a0124(1-2), 69\u201391 (2010)","journal-title":"Mathematical Programming"},{"key":"20_CR11","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1002\/(SICI)1097-0037(199810)32:3<207::AID-NET5>3.0.CO;2-O","volume":"32","author":"T. Koch","year":"1998","unstructured":"Koch, T., Martin, A.: Solving Steiner tree problems in graphs to optimality. Networks\u00a032, 207\u2013232 (1998)","journal-title":"Networks"},{"key":"20_CR12","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. Lee","year":"1998","unstructured":"Lee, H., Dooly, D.: Decomposition algorithms for the maximum-weight connected graph problem. Naval Research Logistics\u00a045, 817\u2013837 (1998)","journal-title":"Naval Research Logistics"},{"unstructured":"Ljubi\u0107, I.: Exact and Memetic Algorithms for Two Network Design Problems. PhD thesis, Vienna University of Technology (2004)","key":"20_CR13"},{"key":"20_CR14","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I. Ljubi\u0107","year":"2006","unstructured":"Ljubi\u0107, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem. Mathematical Programming, Series B\u00a0105, 427\u2013449 (2006)","journal-title":"Mathematical Programming, Series B"},{"issue":"2","key":"20_CR15","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."}],"container-title":["Lecture Notes in Computer Science","Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38171-3_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,29]],"date-time":"2020-12-29T01:10:04Z","timestamp":1609204204000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38171-3_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642381706","9783642381713"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38171-3_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}