{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T20:48:40Z","timestamp":1725482920153},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540716143"},{"type":"electronic","value":"9783540716150"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-71615-0_16","type":"book-chapter","created":{"date-parts":[[2007,4,18]],"date-time":"2007-04-18T18:51:34Z","timestamp":1176922294000},"page":"176-187","source":"Crossref","is-referenced-by-count":8,"title":["Combining Lagrangian Decomposition with an Evolutionary Algorithm for the Knapsack Constrained Maximum Spanning Tree Problem"],"prefix":"10.1007","author":[{"given":"Sandro","family":"Pirkwieser","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]},{"given":"Jakob","family":"Puchinger","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"16_CR1","unstructured":"Yamamato, Y., Kubo, M.: Invitation to the Traveling Salesman\u2019s Problem (in Japanese). Asakura, Tokyo (1997)"},{"issue":"1","key":"16_CR2","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1080\/00207160412331290667","volume":"82","author":"T. Yamada","year":"2005","unstructured":"Yamada, T., Watanabe, K., Katakoa, S.: Algorithms to solve the knapsack constrained maximum spanning tree problem. Int. Journal of Computer Mathematics\u00a082(1), 23\u201334 (2005)","journal-title":"Int. Journal of Computer Mathematics"},{"key":"16_CR3","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S.: A Lagrangian Decomposition Approach Combined with Metaheuristics for the Knapsack Constrained Maximum Spanning Tree Problem. Master\u2019s thesis, Vienna University of Technology, Institute of Computer Graphics and Algorithms (October 2006)","DOI":"10.1007\/978-3-540-71615-0_16"},{"issue":"4","key":"16_CR4","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., Nair, K.: Minimal spanning tree subject to a side constraint. Comput. & Operations Res.\u00a09(4), 287\u2013296 (1982)","journal-title":"Comput. & Operations Res."},{"issue":"4","key":"16_CR5","doi-asserted-by":"crossref","first-page":"475","DOI":"10.1080\/02331938808843366","volume":"19","author":"K. J\u00f6rnsten","year":"1988","unstructured":"J\u00f6rnsten, K., Migdalas, S.: Designing a minimal spanning tree network subject to a budget constraint. Optimization\u00a019(4), 475\u2013484 (1988)","journal-title":"Optimization"},{"issue":"1","key":"16_CR6","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: The Lagrangian Relaxation Method for Solving Integer Programming Problems. Management Science\u00a027(1), 1\u201318 (1981)","journal-title":"Management Science"},{"key":"16_CR7","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1287\/inte.15.2.10","volume":"15","author":"M.L. Fisher","year":"1985","unstructured":"Fisher, M.L.: An application oriented guide to Lagrangean Relaxation. Interfaces\u00a015, 10\u201321 (1985)","journal-title":"Interfaces"},{"key":"16_CR8","first-page":"243","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"J.E. Beasley","year":"1993","unstructured":"Beasley, J.E.: Lagrangian relaxation. In: Reeves, C.R. (ed.) Modern Heuristic Techniques for Combinatorial Problems, pp. 243\u2013303. John Wiley & Sons Inc., New York (1993)"},{"key":"16_CR9","doi-asserted-by":"publisher","first-page":"48","DOI":"10.2307\/2033241","volume":"7","author":"J.B. Kruskal","year":"1956","unstructured":"Kruskal, J.B.: On the shortest spanning subtree of a graph and the travelling salesman problem. In: Proc. of the AMS, vol. 7, pp. 48\u201350 (1956)","journal-title":"Proc. of the AMS."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"1389","DOI":"10.1002\/j.1538-7305.1957.tb01515.x","volume":"36","author":"R.C. Prim","year":"1957","unstructured":"Prim, R.C.: Shortest connection networks and some generalizations. Bell Systems Technology Journal\u00a036, 1389\u20131401 (1957)","journal-title":"Bell Systems Technology Journal"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/BF01840439","volume":"1","author":"M.L. Fredman","year":"1986","unstructured":"Fredman, M.L., Sedgewick, R., Sleator, D.D., Tarjan, R.E.: The pairing heap: A new form of self-adjusting heap. Algorithmica\u00a01(1), 111\u2013129 (1986)","journal-title":"Algorithmica"},{"key":"16_CR12","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-24777-7","volume-title":"Knapsack Problems","author":"H. Kellerer","year":"2004","unstructured":"Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin Heidelberg New York (2004)"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1287\/mnsc.45.3.414","volume":"45","author":"S. Martello","year":"1999","unstructured":"Martello, S., Pisinger, D., Toth, P.: Dynamic programming and strong bounds for the 0\u20131 knapsack problem. Management Science\u00a045, 414\u2013424 (1999)","journal-title":"Management Science"},{"issue":"3","key":"16_CR14","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/s101070050002","volume":"87","author":"F. Barahona","year":"2000","unstructured":"Barahona, F., Anbil, R.: The volume algorithm: producing primal solutions with a subgradient method. Mathematical Programming\u00a087(3), 385\u2013399 (2000)","journal-title":"Mathematical Programming"},{"issue":"5","key":"16_CR15","doi-asserted-by":"publisher","first-page":"1274","DOI":"10.1016\/j.cor.2004.09.017","volume":"33","author":"M. Haouaria","year":"2006","unstructured":"Haouaria, M., Siala, J.C.: A hybrid Lagrangian genetic algorithm for the prize collecting Steiner tree problem. Comput. & Operations Res.\u00a033(5), 1274\u20131288 (2006)","journal-title":"Comput. & Operations Res."},{"key":"16_CR16","first-page":"503","volume-title":"Handbooks in Operations Research and Management Science","author":"T.L. Magnanti","year":"1995","unstructured":"Magnanti, T.L., Wolsey, L.A.: Optimal trees. In: Ball, M.O., et al. (eds.) Handbooks in Operations Research and Management Science, vol.\u00a07, pp. 503\u2013615. Elsevier Science, North-Holland, Amsterdam (1995)"},{"issue":"3","key":"16_CR17","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1109\/TEVC.2002.807275","volume":"7","author":"B.A. Julstrom","year":"2003","unstructured":"Julstrom, B.A., Raidl, G.R.: Edge sets: an effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation\u00a07(3), 225\u2013239 (2003)","journal-title":"IEEE Transactions on Evolutionary Computation"}],"container-title":["Lecture Notes in Computer Science","Evolutionary Computation in Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-71615-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:03:17Z","timestamp":1558270997000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-71615-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540716143","9783540716150"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-71615-0_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}