{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:59:35Z","timestamp":1725893975380},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540735557"},{"type":"electronic","value":"9783540735564"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73556-4_18","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T15:55:47Z","timestamp":1188316547000},"page":"154-162","source":"Crossref","is-referenced-by-count":3,"title":["Exact Algorithms for Generalized Combinatorial Optimization Problems"],"prefix":"10.1007","author":[{"given":"Petrica C.","family":"Pop","sequence":"first","affiliation":[]},{"given":"Corina","family":"Pop Sitar","sequence":"additional","affiliation":[]},{"given":"Ioana","family":"Zelina","sequence":"additional","affiliation":[]},{"given":"Ioana","family":"Ta\u015fcu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"18_CR1","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1023\/A:1009881326671","volume":"4","author":"M. Dror","year":"2000","unstructured":"Dror, M., Haouari, M.: Generalized Steiner Problems and Other Variants. Journal of Combinatorial Optimization\u00a04, 415\u2013436 (2000)","journal-title":"Journal of Combinatorial Optimization"},{"key":"18_CR2","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1016\/S0377-2217(99)00006-5","volume":"120","author":"M. Dror","year":"2000","unstructured":"Dror, M., Haouari, M., Chaouachi, J.: Generalized Spanning Trees. European Journal of Operational Research\u00a0120, 583\u2013592 (2000)","journal-title":"European Journal of Operational Research"},{"key":"18_CR3","doi-asserted-by":"crossref","unstructured":"Feremans, C.: Generalized Spanning Trees and Extensions, PhD thesis, Universite Libre de Bruxelles, Belgium (2001)","DOI":"10.1016\/S0377-2217(00)00267-8"},{"issue":"1","key":"18_CR4","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1002\/net.10009","volume":"39","author":"C. Feremans","year":"2002","unstructured":"Feremans, C., Labbe, M., Laporte, G.: A Comparative Analysis of Several Formulations of the Generalized Minimum Spanning Tree Problem. Networks\u00a039(1), 29\u201334 (2002)","journal-title":"Networks"},{"key":"18_CR5","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1002\/net.3230260206","volume":"26","author":"M. Fischetti","year":"1995","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: The symmetric generalized traveling salesman polytope. Networks\u00a026, 113\u2013123 (1995)","journal-title":"Networks"},{"key":"18_CR6","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1287\/opre.45.3.378","volume":"45","author":"M. Fischetti","year":"1997","unstructured":"Fischetti, M., Salazar, J.J., Toth, P.: A branch-and-cut algorithm for the symmetric generalized traveling salesman problem. Operations Research\u00a045, 378\u2013394 (1997)","journal-title":"Operations Research"},{"key":"18_CR7","doi-asserted-by":"crossref","first-page":"1095","DOI":"10.1287\/mnsc.32.9.1095","volume":"32\/9","author":"M.L. Fisher","year":"1986","unstructured":"Fisher, M.L., Jaikumar, R., van Wassenhove, L.N.: A multiplier adjustment method for generalized assignment problem. Management Science\u00a032\/9, 1095\u20131103 (1986)","journal-title":"Management Science"},{"key":"18_CR8","volume-title":"Computers and Intractability: A guide to the theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A guide to the theory of NP-Completeness. Freeman, San Francisco, California (1979)"},{"key":"18_CR9","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1002\/nav.3800020109","volume":"2","author":"H.W. Kuhn","year":"1955","unstructured":"Kuhn, H.W.: The hungarian method for the assignment problem. Naval Research Logistic Quarterly\u00a02, 83\u201397 (1955)","journal-title":"Naval Research Logistic Quarterly"},{"key":"18_CR10","doi-asserted-by":"publisher","first-page":"1461","DOI":"10.1057\/palgrave.jors.0471204","volume":"47","author":"G. Laporte","year":"1996","unstructured":"Laporte, G., Asef-Vaziri, A., Sriskandarajah, C.: Some applications of the generalized traveling salesman problem. J. Oper. Res. Soc.\u00a047, 1461\u20131467 (1996)","journal-title":"J. Oper. Res. Soc."},{"key":"18_CR11","first-page":"61","volume":"21","author":"G. Laporte","year":"1983","unstructured":"Laporte, G., Nobert, Y.: Generalized Traveling Salesman through n sets of nodes: an integer programming approach. INFOR\u00a021, 61\u201375 (1983)","journal-title":"INFOR"},{"key":"18_CR12","doi-asserted-by":"crossref","first-page":"623","DOI":"10.1287\/opre.39.4.623","volume":"39","author":"C.E. Noon","year":"1991","unstructured":"Noon, C.E., Bean, J.C.: A Lagrangian based approach for the asymmetric generalized traveling salesman problem. Operations Research\u00a039, 623\u2013632 (1991)","journal-title":"Operations Research"},{"key":"18_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1002\/net.3230260407","volume":"26","author":"Y.S. Myung","year":"1995","unstructured":"Myung, Y.S., Lee, C.H., Tcha, D.w.: On the Generalized Minimum Spanning Tree Problem. Networks\u00a026, 231\u2013241 (1995)","journal-title":"Networks"},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: The Generalized Minimum Spanning Tree Problem, PhD thesis, University of Twente, The Netherlands (2002)","DOI":"10.1016\/S0377-2217(02)00213-8"},{"issue":"2","key":"18_CR15","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1023\/B:JMMA.0000036579.83218.8d","volume":"3","author":"P.C. Pop","year":"2004","unstructured":"Pop, P.C.: New Models of the Generalized Minimum Spanning Tree Problem. Journal of Mathematical Modelling and Algorithms\u00a03(2), 153\u2013166 (2004)","journal-title":"Journal of Mathematical Modelling and Algorithms"},{"key":"18_CR16","doi-asserted-by":"crossref","unstructured":"Pop, P.C.: On the Prize-Collecting Generalized Minimum Spanning Tree Problem. In Annals of Operations Research (to appear)","DOI":"10.1007\/s10479-006-0153-1"},{"key":"18_CR17","doi-asserted-by":"crossref","unstructured":"Pop, P.C., Kern, W., Still, G.: Approximation Theory in Combinatorial Optimization. Application to the Generalized Minimum Spanning Tree Problem, Revue d\u2019Analyse Numerique et de Theorie de l\u2019Approximation, Tome, vol. 34(1), pp. 93\u2013102 (2005)","DOI":"10.33993\/jnaat341-795"},{"key":"18_CR18","doi-asserted-by":"publisher","first-page":"900","DOI":"10.1016\/j.ejor.2004.07.058","volume":"170","author":"P.C. Pop","year":"2006","unstructured":"Pop, P.C., Kern, W., Still, G.: A New Relaxation Method for the Generalized Minimum Spanning Tree Problem. European Journal of Operational Research\u00a0170, 900\u2013908 (2006)","journal-title":"European Journal of Operational Research"},{"key":"18_CR19","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/0022-0000(91)90024-Y","volume":"43","author":"M. Yannakakis","year":"1991","unstructured":"Yannakakis, M.: Expressing combinatorial optimization problems by linear programs. Journal of Computer and System Sciences\u00a043, 441\u2013466 (1991)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73556-4_18.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,17]],"date-time":"2024-02-17T16:47:10Z","timestamp":1708188430000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73556-4_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540735557","9783540735564"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73556-4_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}