{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,31]],"date-time":"2025-10-31T07:42:29Z","timestamp":1761896549383,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319623948"},{"type":"electronic","value":"9783319623955"}],"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":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-62395-5_46","type":"book-chapter","created":{"date-parts":[[2017,7,6]],"date-time":"2017-07-06T00:52:59Z","timestamp":1499302379000},"page":"669-683","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Feasibility Pump and a Local Branching Heuristics for the Weight-Constrained Minimum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Requejo","sequence":"first","affiliation":[]},{"given":"Eul\u00e1lia","family":"Santos","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,7,7]]},"reference":[{"issue":"1","key":"46_CR1","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/j.disopt.2006.10.004","volume":"4","author":"T Achterberg","year":"2007","unstructured":"Achterberg, T., Berthold, T.: Improving the feasibility pump. Discrete Optim. 4(1), 77\u201386 (2007)","journal-title":"Discrete Optim."},{"key":"46_CR2","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1016\/0305-0548(82)90026-0","volume":"9","author":"V Aggarwal","year":"1982","unstructured":"Aggarwal, V., Aneja, Y.P., Nair, K.P.K.: Minimal spanning tree subject to a side constraint. Comput. Oper. Res. 9, 287\u2013296 (1982)","journal-title":"Comput. Oper. Res."},{"key":"46_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1007\/978-3-642-21527-8_20","volume-title":"Network Optimization","author":"A Agra","year":"2011","unstructured":"Agra, A., Cerveira, A., Requejo, C., Santos, E.: On the weight-constrained minimum spanning tree problem. In: Pahl, J., Reiners, T., Vo\u00df, S. (eds.) INOC 2011. LNCS, vol. 6701, pp. 156\u2013161. Springer, Heidelberg (2011). doi:10.1007\/978-3-642-21527-8_20"},{"issue":"3","key":"46_CR4","doi-asserted-by":"publisher","first-page":"1111","DOI":"10.1007\/s10878-014-9812-3","volume":"31","author":"A Agra","year":"2016","unstructured":"Agra, A., Requejo, C., Santos, E.: Implicit cover inequalities. J. Combin. Optim. 31(3), 1111\u20131129 (2016)","journal-title":"J. Combin. Optim."},{"issue":"1","key":"46_CR5","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.disopt.2006.10.001","volume":"4","author":"L Bertacco","year":"2007","unstructured":"Bertacco, L., Fischetti, M., Lodi, A.: A feasibility pump heuristic for general mixed-integer problems. Discrete Optim. 4(1), 63\u201376 (2007)","journal-title":"Discrete Optim."},{"issue":"1","key":"46_CR6","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-004-0570-3","volume":"104","author":"M Fischetti","year":"2005","unstructured":"Fischetti, M., Glover, F., Lodi, A.: The feasibility pump. Math. Program. 104(1), 91\u2013104 (2005)","journal-title":"Math. Program."},{"issue":"1\u20133","key":"46_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10107-003-0395-5","volume":"98","author":"M Fischetti","year":"2003","unstructured":"Fischetti, M., Lodi, A.: Local branching. Math. Program. 98(1\u20133), 23\u201347 (2003)","journal-title":"Math. Program."},{"issue":"10","key":"46_CR8","doi-asserted-by":"publisher","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u0161evi\u0107, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33(10), 3034\u20133045 (2006)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"46_CR9","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1137\/S0097539703426775","volume":"33","author":"R Hassin","year":"2004","unstructured":"Hassin, R., Levin, A.: An efficient polynomial time approximation scheme for the constrained minimum spanning tree problem using matroid intersection. SIAM J. Comput. 33(2), 261\u2013268 (2004)","journal-title":"SIAM J. Comput."},{"key":"46_CR10","unstructured":"Henn, S.: Weight-constrained minimum spanning tree problem. Master\u2019s thesis, University of Kaiserslautern, Kaiserslautern, Germany (2007)"},{"key":"46_CR11","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1016\/j.orl.2003.06.003","volume":"32","author":"S Hong","year":"2004","unstructured":"Hong, S., Chung, S., Park, B.H.: A fully polynomial bicriteria approximation scheme for the constrained spanning tree problem. Oper. Res. Lett. 32, 233\u2013239 (2004)","journal-title":"Oper. Res. Lett."},{"key":"46_CR12","doi-asserted-by":"crossref","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M., Magnanti, T.L., Monma, C., Nemhauser, G.L. (eds.) Network Models, Handbooks in Operations Research and Management Science, vol. 7, pp. 503\u2013615. Elsevier Science Publishers, North-Holland (1995)","DOI":"10.1016\/S0927-0507(05)80126-4"},{"issue":"11","key":"46_CR13","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"9","key":"46_CR14","doi-asserted-by":"publisher","first-page":"2271","DOI":"10.1016\/j.cor.2004.03.002","volume":"32","author":"D Pisinger","year":"2005","unstructured":"Pisinger, D.: Where are the hard knapsack problems? Comput. Oper. Res. 32(9), 2271\u20132284 (2005)","journal-title":"Comput. Oper. Res."},{"key":"46_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1007\/3-540-61422-2_121","volume-title":"Algorithm Theory \u2014 SWAT\u201996","author":"R Ravi","year":"1996","unstructured":"Ravi, R., Goemans, M.X.: The constrained minimum spanning tree problem. In: Karlsson, R., Lingas, A. (eds.) SWAT 1996. LNCS, vol. 1097, pp. 66\u201375. Springer, Heidelberg (1996). doi:10.1007\/3-540-61422-2_121"},{"key":"46_CR16","doi-asserted-by":"publisher","first-page":"2166","DOI":"10.1063\/1.3498397","volume":"1281","author":"C Requejo","year":"2010","unstructured":"Requejo, C., Agra, A., Cerveira, A., Santos, E.: Formulations for the weight-constrained minimum spanning tree problem. AIP Conf. Proc. 1281, 2166\u20132169 (2010)","journal-title":"AIP Conf. Proc."},{"key":"46_CR17","unstructured":"Requejo, C., Santos, E.: Lagrangian based algorithms for the weight-constrained minimum spanning tree problem. In: Proceedings of the VII ALIO\/EURO Workshop on Applied Combinatorial Optimization, pp. 38\u201341 (2011)"},{"key":"46_CR18","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1002\/net.3230130203","volume":"13","author":"A Shogan","year":"1983","unstructured":"Shogan, A.: Constructing a minimal-cost spanning tree subject to resource constraints and flow requirements. Networks 13, 169\u2013190 (1983)","journal-title":"Networks"},{"issue":"3","key":"46_CR19","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1287\/ijoc.1070.0260","volume":"20","author":"F Sourd","year":"2008","unstructured":"Sourd, F., Spanjaard, O.: A multiobjective branch-and-bound framework: application to the biobjective spanning tree problem. INFORMS J. Comput. 20(3), 472\u2013484 (2008)","journal-title":"INFORMS J. Comput."},{"key":"46_CR20","unstructured":"Xue, G.: Primal-dual algorithms for computing weight-constrained shortest paths and weight-constrained minimum spanning trees. In: Proceedings of the IEEE International Conference on Performance, Computing, and Communications, pp. 271\u2013277 (2000)"},{"key":"46_CR21","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00207160412331290667","volume":"82","author":"T Yamada","year":"2005","unstructured":"Yamada, T., Watanabe, K., Kataoka, S.: Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. J. Comput. Math. 82, 23\u201334 (2005)","journal-title":"Int. J. Comput. Math."}],"container-title":["Lecture Notes in Computer Science","Computational Science and Its Applications \u2013 ICCSA 2017"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-62395-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T12:29:59Z","timestamp":1710332999000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-62395-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319623948","9783319623955"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-62395-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"7 July 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCSA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science and Its Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 July 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccsa2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.iccsa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}