{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:25:45Z","timestamp":1742912745084,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030059828"},{"type":"electronic","value":"9783030059835"}],"license":[{"start":{"date-parts":[[2018,12,18]],"date-time":"2018-12-18T00:00:00Z","timestamp":1545091200000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05983-5_4","type":"book-chapter","created":{"date-parts":[[2018,12,17]],"date-time":"2018-12-17T12:27:46Z","timestamp":1545049666000},"page":"46-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Strategies for Iteratively Refining Layered Graph Models"],"prefix":"10.1007","author":[{"given":"Martin","family":"Riedler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mario","family":"Ruthmair","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,12,18]]},"reference":[{"issue":"3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1007\/PL00011432","volume":"90","author":"N Ascheuer","year":"2001","unstructured":"Ascheuer, N., Fischetti, M., Gr\u00f6tschel, M.: Solving the asymmetric travelling salesman problem with time windows by branch-and-cut. Math. Program. Ser. B 90(3), 475\u2013506 (2001)","journal-title":"Math. Program. Ser. B"},{"issue":"3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1287\/ijoc.1110.0456","volume":"24","author":"R Baldacci","year":"2012","unstructured":"Baldacci, R., Mingozzi, A., Roberti, R.: New state-space relaxations for solving the traveling salesman problem with time windows. INFORMS J. Comput. 24(3), 356\u2013371 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"1303","DOI":"10.1287\/opre.2017.1624","volume":"65","author":"N Boland","year":"2017","unstructured":"Boland, N., Hewitt, M., Marshall, L., Savelsbergh, M.: The continuous-time service network design problem. Oper. Res. 65(5), 1303\u20131321 (2017)","journal-title":"Oper. Res."},{"key":"4_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1007\/978-3-319-59776-8_21","volume-title":"Integration of AI and OR Techniques in Constraint Programming","author":"N Boland","year":"2017","unstructured":"Boland, N., Hewitt, M., Vu, D.M., Savelsbergh, M.: Solving the traveling salesman problem with time windows through dynamically generated time-expanded networks. In: Salvagnin, D., Lombardi, M. (eds.) CPAIOR 2017. LNCS, vol. 10335, pp. 254\u2013262. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-59776-8_21"},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1016\/j.ejor.2016.09.051","volume":"258","author":"F Clautiaux","year":"2017","unstructured":"Clautiaux, F., Hanafi, S., Macedo, R., Voge, M.\u00c9., Alves, C.: Iterative aggregation and disaggregation algorithm for pseudo-polynomial network flow models with side constraints. Eur. J. Oper. Res. 258(2), 467\u2013477 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1287\/ijoc.1100.0432","volume":"24","author":"S Dash","year":"2012","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Lodi, A., Tramontani, A.: A time bucket formulation for the traveling salesman problem with time windows. INFORMS J. Comput. 24(1), 132\u2013147 (2012)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"4_CR7","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1287\/opre.43.2.367","volume":"43","author":"Y Dumas","year":"1995","unstructured":"Dumas, Y., Desrosiers, J., Gelinas, E., Solomon, M.M.: An optimal algorithm for the traveling salesman problem with time windows. Oper. Res. 43(2), 367\u2013371 (1995)","journal-title":"Oper. Res."},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.cor.2018.09.007","volume":"102","author":"L Gouveia","year":"2019","unstructured":"Gouveia, L., Leitner, M., Ruthmair, M.: Layered graph approaches for combinatorial optimization problems. Comput. Oper. Res. 102, 22\u201338 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR9","doi-asserted-by":"publisher","first-page":"600","DOI":"10.1016\/j.cor.2006.03.022","volume":"35","author":"L Gouveia","year":"2008","unstructured":"Gouveia, L., Paias, A., Sharma, D.: Modeling and solving the rooted distance-constrained minimum spanning tree problem. Comput. Oper. Res. 35(2), 600\u2013613 (2008). Part Special Issue: Location Modeling Dedicated to the memory of Charles S. ReVelle","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR10","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1002\/net.21484","volume":"61","author":"M Leitner","year":"2013","unstructured":"Leitner, M., Ruthmair, M., Raidl, G.R.: Stabilizing branch-and-price for constrained tree problems. Networks 61(2), 150\u2013170 (2013)","journal-title":"Networks"},{"issue":"3","key":"4_CR11","doi-asserted-by":"publisher","first-page":"536","DOI":"10.1016\/j.ejor.2011.04.037","volume":"214","author":"R Macedo","year":"2011","unstructured":"Macedo, R., Alves, C., de Carvalho, J.M.V., Clautiaux, F., Hanafi, S.: Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur. J. Oper. Res. 214(3), 536\u2013545 (2011)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"4_CR12","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"JC Picard","year":"1978","unstructured":"Picard, J.C., Queyranne, M.: The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper. Res. 26(1), 86\u2013110 (1978)","journal-title":"Oper. Res."},{"key":"4_CR13","doi-asserted-by":"publisher","unstructured":"Riedler, M., Jatschka, T., Maschler, J., Raidl, G.R.: An iterative time-bucket refinement algorithm for a high-resolution resource-constrained project scheduling problem. Int. Trans. Oper. Res. (2017). https:\/\/doi.org\/10.1111\/itor.12445","DOI":"10.1111\/itor.12445"},{"key":"4_CR14","unstructured":"Ruthmair, M.: On solving constrained tree problems and an adaptive layers framework. Ph.D. thesis, TU Wien, Vienna (2012)"},{"key":"4_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/978-3-642-20807-2_30","volume-title":"Integer Programming and Combinatoral Optimization","author":"M Ruthmair","year":"2011","unstructured":"Ruthmair, M., Raidl, G.R.: A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems. In: G\u00fcnl\u00fck, O., Woeginger, G.J. (eds.) IPCO 2011. LNCS, vol. 6655, pp. 376\u2013388. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20807-2_30"},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1016\/S0965-8564(00)00037-9","volume":"36","author":"X Wang","year":"2002","unstructured":"Wang, X., Regan, A.C.: Local truckload pickup and delivery with hard time window constraints. Transp. Res. B 36(2), 97\u2013112 (2002)","journal-title":"Transp. Res. B"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05983-5_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T20:23:58Z","timestamp":1710361438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-05983-5_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,18]]},"ISBN":["9783030059828","9783030059835"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05983-5_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,18]]},"assertion":[{"value":"18 December 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Hybrid Metaheuristics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Concepci\u00f3n","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chile","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hm2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/hm2019.ing.udec.cl\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}