{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:20:40Z","timestamp":1742937640609,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319453774"},{"type":"electronic","value":"9783319453781"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-45378-1_19","type":"book-chapter","created":{"date-parts":[[2016,9,8]],"date-time":"2016-09-08T05:04:15Z","timestamp":1473311055000},"page":"206-217","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Fast Branch and Bound Algorithm for the Travelling Salesman Problem"],"prefix":"10.1007","author":[{"given":"Rados\u0142aw","family":"Grymin","sequence":"first","affiliation":[]},{"given":"Szymon","family":"Jagie\u0142\u0142o","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,9,9]]},"reference":[{"key":"19_CR1","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1016\/j.jpdc.2009.01.009","volume":"69","author":"W Bo\u017cejko","year":"2009","unstructured":"Bo\u017cejko, W.: Solving the flow shop problem by parallel programming. J. Parallel Distrib. Comput. 69, 470\u2013481 (2009)","journal-title":"J. Parallel Distrib. Comput."},{"key":"19_CR2","doi-asserted-by":"publisher","first-page":"777","DOI":"10.1007\/s10845-009-0253-2","volume":"21","author":"W Bo\u017cejko","year":"2010","unstructured":"Bo\u017cejko, W.: Parallel path relinking method for the single machine total weighted tardiness problem with sequence-dependent setups. J. Intell. Manuf. 21, 777\u2013785 (2010)","journal-title":"J. Intell. Manuf."},{"key":"19_CR3","doi-asserted-by":"publisher","first-page":"2258","DOI":"10.1016\/j.cor.2011.11.009","volume":"39","author":"W Bo\u017cejko","year":"2012","unstructured":"Bo\u017cejko, W.: On single-walk parallelization of the job shop problem solving algorithms. Comput. Oper. Res. 39, 2258\u20132264 (2012)","journal-title":"Comput. Oper. Res."},{"key":"19_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1007\/978-3-540-24669-5_74","volume-title":"Parallel Processing and Applied Mathematics","author":"W Bo\u017cejko","year":"2004","unstructured":"Bo\u017cejko, W., Wodecki, M.: Parallel genetic algorithm for the flow shop scheduling problem. In: Wyrzykowski, R., Dongarra, J., Paprzycki, M., Wa\u015bniewski, J. (eds.) PPAM 2004. LNCS, vol. 3019, pp. 566\u2013571. Springer, Heidelberg (2004)"},{"issue":"1","key":"19_CR5","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/j.cie.2008.11.022","volume":"57","author":"W Bo\u017cejko","year":"2009","unstructured":"Bo\u017cejko, W., Wodecki, M.: Solving permutational routing problems by population-based metaheuristics. Comput. Ind. Eng. 57(1), 269\u2013276 (2009)","journal-title":"Comput. Ind. Eng."},{"key":"19_CR6","volume-title":"In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation","author":"WJ Cook","year":"2012","unstructured":"Cook, W.J.: In Pursuit of the Traveling Salesman: Mathematics at the Limits of Computation. Princeton University Press, Princeton (2012)"},{"issue":"3","key":"19_CR7","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1016\/0895-7177(90)90371-S","volume":"13","author":"B Feiring","year":"1990","unstructured":"Feiring, B.: An efficient procedure for obtaining feasible solutions to the n-city traveling salesman problem. Math. Comput. Modell. 13(3), 67\u201371 (1990)","journal-title":"Math. Comput. Modell."},{"key":"19_CR8","doi-asserted-by":"publisher","first-page":"2529","DOI":"10.1016\/j.procs.2013.05.434","volume":"18","author":"S Jagie\u0142\u0142o","year":"2013","unstructured":"Jagie\u0142\u0142o, S., \u017belazny, D.: Solving multi-criteria vehicle routing problem by parallel tabu search on GPU. Procedia Comput. Sci. 18, 2529\u20132532 (2013)","journal-title":"Procedia Comput. Sci."},{"key":"19_CR9","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0927-0507(05)80121-5","volume":"7","author":"M J\u00fcnger","year":"1995","unstructured":"J\u00fcnger, M., Rinaldi, G., Reinelt, G.: The traveling salesman problem. Handbooks Oper. Res. Manage. Sci. 7, 225\u2013330 (1995)","journal-title":"Handbooks Oper. Res. Manage. Sci."},{"key":"19_CR10","doi-asserted-by":"publisher","first-page":"497","DOI":"10.2307\/1910129","volume":"28","author":"AH Land","year":"1960","unstructured":"Land, A.H., Doig, A.G.: An automatic method of solving discrete programming problems. Econometrica: J. Econometric Soc. 28, 497\u2013520 (1960)","journal-title":"Econometrica: J. Econometric Soc."},{"key":"19_CR11","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1016\/j.disopt.2016.01.005","volume":"19","author":"DR Morrison","year":"2016","unstructured":"Morrison, D.R., Jacobson, S.H., Sauppe, J.J., Sewell, E.C.: Branch-and-Bound algorithms: a survey of recent advances in searching, branching, and pruning. Discrete Optim. 19, 79\u2013102 (2016)","journal-title":"Discrete Optim."},{"issue":"3","key":"19_CR12","doi-asserted-by":"publisher","first-page":"737","DOI":"10.1016\/j.ejor.2015.10.004","volume":"250","author":"TAM Toffolo","year":"2016","unstructured":"Toffolo, T.A.M., Wauters, T., Malderen, S.V., Berghe, G.V.: Branch-and-Bound with decomposition-based lower bounds for the Traveling Umpire Problem. Eur. J. Oper. Res. 250(3), 737\u2013744 (2016)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Lecture Notes in Computer Science","Computer Information Systems and Industrial Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-45378-1_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,25]],"date-time":"2024-06-25T08:05:45Z","timestamp":1719302745000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-45378-1_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319453774","9783319453781"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-45378-1_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CISIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Computer Information Systems and Industrial Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Vilnius","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lithuania","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cisim2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}