{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T19:59:31Z","timestamp":1743019171969,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319429014"},{"type":"electronic","value":"9783319429021"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-42902-1_14","type":"book-chapter","created":{"date-parts":[[2017,3,6]],"date-time":"2017-03-06T21:21:19Z","timestamp":1488835279000},"page":"101-108","source":"Crossref","is-referenced-by-count":0,"title":["A Comparison of Heuristic Methods for the Prize-Collecting Steiner Tree Problem and Their Application in Genomics"],"prefix":"10.1007","author":[{"given":"Murodzhon","family":"Akhmedov","sequence":"first","affiliation":[]},{"given":"Ivo","family":"Kwee","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Montemanni","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,3,8]]},"reference":[{"unstructured":"Johnson, D.S., Minkoff, M., Phillips, S.: The prize collecting Steiner tree problem: theory and practice. In: Proceedings of 11th ACM\u2013SIAM Symposium on Discrete Algorithms, pp. 760\u2013769 (2000)","key":"14_CR1"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"882","DOI":"10.1073\/pnas.1004751108","volume":"108","author":"MB Bechet","year":"2010","unstructured":"Bechet, M.B., Borgs, C., Braunsteinc, A., Chayes, J., Dagkessamanskaia, A., Fran\u00e7ois, J.M., Zecchina, R.: Finding undetected protein associations in cell signalling by belief propagation. PNAS 108, 882\u2013887 (2010)","journal-title":"PNAS"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M.X., Simchi-Levi, D., Williamson, D.: A note on the prize collecting traveling salesman problem. Math. Progr. 59, 413\u2013420 (1993)","journal-title":"Math. Progr."},{"key":"14_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1002\/net.3230170102","volume":"17","author":"A Segev","year":"1987","unstructured":"Segev, A.: The node-weighted Steiner tree problem. Networks 17, 1\u201317 (1987)","journal-title":"Networks"},{"issue":"2","key":"14_CR5","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1007\/s10107-005-0660-x","volume":"105","author":"I Ljubic","year":"2006","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G.W., Mutzel, P., Fischetti, M.: An algorithmic framework for the exact solution of the prize\n            $$-$$\n          collecting Steiner tree problem. Math. Progr. 105(2), 427\u2013449 (2006)","journal-title":"Math. Progr."},{"unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: Solving the prize\n            $$-$$\n          collecting Steiner tree problem to optimality. Proceedings of ALENEX, Seventh Workshop on Algorithm Engineering and Experiments, pp. 68\u201376 (2005)","key":"14_CR6"},{"key":"14_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1002\/net.1023","volume":"38","author":"SA Canuto","year":"2001","unstructured":"Canuto, S.A., Resende, M.G.C., Ribeiro, C.C.: Local search with perturbation for the prize- collecting Steiner tree problem in graphs. Networks 38, 50\u201358 (2001)","journal-title":"Networks"},{"issue":"3102","key":"14_CR8","first-page":"1304","volume":"2004","author":"GW Klau","year":"2004","unstructured":"Klau, G.W., Ljubic, I., Moser, A., Mutzel, P., Neuner, P., Pferschy, U., Raidl, G., Weiskircher, R.: Combining a memetic algorithm with integer programming to solve the prize-collecting Steiner tree problem. Genet. Evol. Comput. GECCO 2004(3102), 1304\u20131315 (2004)","journal-title":"Genet. Evol. Comput. GECCO"},{"doi-asserted-by":"crossref","unstructured":"Tuncbag, N., McCallum, S., Huang, S.C., Fraenkel, E.: SteinerNet: a web server for integrating omic data to discover hidden components of response pathways. Nucl. Acids Res. 1\u20135 (2012)","key":"14_CR9","DOI":"10.1093\/nar\/gks445"},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1093\/bioinformatics\/btn161","volume":"26","author":"MT Dittrich","year":"2008","unstructured":"Dittrich, M.T., Klau, G.W., Rosenwald, A., Dandekar, T., Mueller, T.: Identifying functional modules in protein-protein interaction networks: an integrated exact approach. Bioinformatics 26, 223\u2013231 (2008)","journal-title":"Bioinformatics"},{"issue":"8","key":"14_CR11","doi-asserted-by":"crossref","first-page":"1129","DOI":"10.1093\/bioinformatics\/btq089","volume":"26","author":"D Beisser","year":"2010","unstructured":"Beisser, D., Klau, G.W., Dandekar, T., Mueller, T.: T, and M. Dittrich. BioNet: an R-package for the functional analysis of biological networks. Bioinformatics 26(8), 1129\u20131130 (2010)","journal-title":"Bioinformatics"},{"key":"14_CR12","first-page":"207","volume":"6","author":"M Akhmedov","year":"2014","unstructured":"Akhmedov, M., Kwee, I., Montemanni, R.: A fast heuristic for the prize-collecting steiner tree problem. Lect. Notes Manag. Sci. 6, 207\u2013216 (2014)","journal-title":"Lect. Notes Manag. Sci."},{"doi-asserted-by":"crossref","unstructured":"Akhmedov, M., Kwee, I., Montemanni, R.: A divide and conquer matheuristic algorithm for the prize-collecting Steiner tree problem. Computers and Operation Research (to appear)","key":"14_CR13","DOI":"10.1016\/j.cor.2015.12.015"},{"issue":"Suppl 1","key":"14_CR14","doi-asserted-by":"crossref","first-page":"S7","DOI":"10.1186\/1471-2105-7-S1-S7","volume":"7","author":"AA Margolin","year":"2006","unstructured":"Margolin, A.A., Nemenman, I., Basso, K., Wiggins, C., Stolovitzky, G., Favera, R.D., Califano, A.: Aracne: an algorithm for the reconstruction of gene regulatory networks in a mammalian cellular context. BMC Bioinform. 7(Suppl 1), S7 (2006)","journal-title":"BMC Bioinform."}],"container-title":["Operations Research Proceedings","Operations Research Proceedings 2015"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42902-1_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,1,4]],"date-time":"2018-01-04T08:26:20Z","timestamp":1515054380000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42902-1_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319429014","9783319429021"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42902-1_14","relation":{},"ISSN":["0721-5924","2197-9294"],"issn-type":[{"type":"print","value":"0721-5924"},{"type":"electronic","value":"2197-9294"}],"subject":[],"published":{"date-parts":[[2017]]}}}