{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T06:01:02Z","timestamp":1742968862508,"version":"3.40.3"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496615"},{"type":"electronic","value":"9783031496622"}],"license":[{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,15]],"date-time":"2023-12-15T00:00:00Z","timestamp":1702598400000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49662-2_10","type":"book-chapter","created":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:03:00Z","timestamp":1702558980000},"page":"178-200","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Matheuristic Local Search for\u00a0the\u00a0Placement of\u00a0Analog Integrated Circuits"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1136-370X","authenticated-orcid":false,"given":"Josef","family":"Grus","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8135-1296","authenticated-orcid":false,"given":"Zden\u011bk","family":"Hanz\u00e1lek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,15]]},"reference":[{"issue":"4","key":"10_CR1","doi-asserted-by":"publisher","first-page":"1065","DOI":"10.1016\/j.cor.2006.07.004","volume":"35","author":"R Alvarez-Valdes","year":"2008","unstructured":"Alvarez-Valdes, R., Parre\u00f1o, F., Tamarit, J.: Reactive GRASP for the strip-packing problem. Comput. Oper. Res. 35(4), 1065\u20131083 (2008)","journal-title":"Comput. Oper. Res."},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1007\/978-3-642-00142-0_69","volume-title":"Operations Research Proceedings 2008","author":"M Berger","year":"2009","unstructured":"Berger, M., Schr\u00f6der, M., K\u00fcfer, K.H.: A constraint-based approach for the two-dimensional rectangular packing problem with orthogonal orientations. In: Fleischmann, B., Borgwardt, K.H., Klein, R., Tuma, A. (eds.) Operations Research Proceedings 2008, vol. 2008, pp. 427\u2013432. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-00142-0_69"},{"issue":"5","key":"10_CR3","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1287\/inte.20.5.61","volume":"20","author":"JD Camm","year":"1990","unstructured":"Camm, J.D., Raturi, A.S., Tsubakitani, S.: Cutting big M down to size. Interfaces 20(5), 61\u201366 (1990)","journal-title":"Interfaces"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"Chen, T.C., Jiang, Z.W., Hsu, T.C., Chen, H.C., Chang, Y.W.: NTUplace3: an analytical placer for large-scale mixed-size designs with preplaced blocks and density constraints. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 27(7), 1228\u20131240 (2008)","DOI":"10.1109\/TCAD.2008.923063"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Christiaens, J., Vanden Berghe, G.: Slack induction by string removals for vehicle routing problems. Transp. Sci. 54, 417\u2013433 (2020)","DOI":"10.1287\/trsc.2019.0914"},{"issue":"3","key":"10_CR6","doi-asserted-by":"publisher","first-page":"330","DOI":"10.1109\/4.75012","volume":"26","author":"J Cohn","year":"1991","unstructured":"Cohn, J., Garrod, D., Rutenbar, R., Carley, L.: KOAN\/ANAGRAM II: new tools for device-level analog placement and routing. IEEE J. Solid-State Circ. 26(3), 330\u2013342 (1991)","journal-title":"IEEE J. Solid-State Circ."},{"key":"10_CR7","unstructured":"CORDIS: Analog\/mixed signal back end design automation based on machine learning and artificial intelligence techniques (AMBEATion). https:\/\/cordis.europa.eu\/project\/id\/101007730. Accessed 16 May 2023"},{"key":"10_CR8","unstructured":"DARPA: Intelligent Design of Electronic Assets (IDEA). https:\/\/www.darpa.mil\/program\/intelligent-design-of-electronic-assets. Accessed 16 May 2023"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Deghdak, K., T\u2019kindt, V., Bouquard, J.L.: Scheduling evacuation operations. J. Sched. 19(4), 467\u2013478 (2016)","DOI":"10.1007\/s10951-015-0461-x"},{"issue":"1","key":"10_CR10","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10479-011-0928-x","volume":"213","author":"F Della Croce","year":"2014","unstructured":"Della Croce, F., Grosso, A., Salassa, F.: A matheuristic approach for the two-machine total completion time flow shop problem. Ann. Oper. Res. 213(1), 67\u201378 (2014)","journal-title":"Ann. Oper. Res."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.trb.2020.11.012","volume":"144","author":"D Dumez","year":"2021","unstructured":"Dumez, D., Lehu\u00e9d\u00e9, F., P\u00e9ton, O.: A large neighborhood search approach to the vehicle routing problem with delivery options. Transp. Res. Part B: Methodological 144, 103\u2013132 (2021)","journal-title":"Transp. Res. Part B: Methodological"},{"key":"10_CR12","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-07124-4_14","volume-title":"Handbook of Heuristics","author":"M Fischetti","year":"2018","unstructured":"Fischetti, M., Fischetti, M.: Matheuristics. In: Mart\u00ed, R., Pardalos, P.M., Resende, M.G.C. (eds.) Handbook of Heuristics, pp. 121\u2013153. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-07124-4_14"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"Grus., J., Hanz\u00e1lek., Z., Barri., D., Vacula., P.: Automatic placer for analog circuits using integer linear programming warm started by graph drawing. In: Proceedings of the 12th International Conference on Operations Research and Enterprise Systems, pp. 106\u2013116 (2023)","DOI":"10.5220\/0011789300003396"},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1016\/S0360-8352(99)00097-2","volume":"37","author":"E Hopper","year":"1999","unstructured":"Hopper, E., Turton, B.: A genetic algorithm for a 2D industrial packing problem. Comput. Ind. Eng. 37(1), 375\u2013378 (1999)","journal-title":"Comput. Ind. Eng."},{"key":"10_CR15","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1016\/j.cor.2018.11.002","volume":"103","author":"A Klausnitzer","year":"2019","unstructured":"Klausnitzer, A., Lasch, R.: Optimal facility layout and material handling network design. Comput. Oper. Res. 103, 237\u2013251 (2019)","journal-title":"Comput. Oper. Res."},{"issue":"1","key":"10_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10479-008-0463-6","volume":"179","author":"R Korf","year":"2010","unstructured":"Korf, R., Moffitt, M., Pollack, M.: Optimal rectangle packing. Ann. Oper. Res. 179(1), 261\u2013295 (2010)","journal-title":"Ann. Oper. Res."},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"Lin, Y., et al.: Are analytical techniques worthwhile for analog IC placement? In: 2022 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp. 154\u2013159 (2022)","DOI":"10.23919\/DATE54114.2022.9774498"},{"issue":"4","key":"10_CR18","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10732-018-9371-3","volume":"24","author":"M Lindahl","year":"2018","unstructured":"Lindahl, M., S\u00f8rensen, M., Stidsen, T.: A fix-and-optimize matheuristic for university timetabling. J. Heuristics 24(4), 645\u2013665 (2018)","journal-title":"J. Heuristics"},{"key":"10_CR19","unstructured":"Lourenco, N., Vianello, M., Guilherme, J., Horta, N.: LAYGEN - automatic layout generation of analog ICs from hierarchical template descriptions. In: 2006 Ph.D. Research in Microelectronics and Electronics, pp. 213\u2013216 (2006)"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"Lu, J., et al.: ePlace: electrostatics-based placement using fast Fourier transform and Nesterov\u2019s method. ACM Trans. Des. Autom. Electron. Syst. 20(2), 1\u201334 (2015)","DOI":"10.1145\/2699873"},{"issue":"1","key":"10_CR21","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1109\/TCAD.2010.2064490","volume":"30","author":"Q Ma","year":"2011","unstructured":"Ma, Q., Xiao, L., Tam, Y.C., Young, E.F.Y.: Simultaneous handling of symmetry, common centroid, and general placement constraints. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 30(1), 85\u201395 (2011)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"Mallappa, U., Pratty, S., Brown, D.: RLPlace: deep RL guided heuristics for detailed placement optimization. In: Proceedings of the 2022 Conference & Exhibition on Design, Automation & Test in Europe, pp. 120\u2013123 (2022)","DOI":"10.23919\/DATE54114.2022.9774684"},{"issue":"23","key":"10_CR23","doi-asserted-by":"publisher","first-page":"9137","DOI":"10.1016\/j.eswa.2015.08.020","volume":"42","author":"R Martins","year":"2015","unstructured":"Martins, R., Louren\u00e7o, N., Horta, N.: Multi-objective optimization of analog integrated circuit placement hierarchy in absolute coordinates. Expert Syst. Appl. 42(23), 9137\u20139151 (2015)","journal-title":"Expert Syst. Appl."},{"issue":"7862","key":"10_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1038\/s41586-021-03544-w","volume":"594","author":"A Mirhoseini","year":"2021","unstructured":"Mirhoseini, A., Goldie, A., Yazgan, M., et al.: A graph placement methodology for fast chip design. Nature 594(7862), 207\u2013212 (2021)","journal-title":"Nature"},{"key":"10_CR25","doi-asserted-by":"crossref","unstructured":"Murata, H., Fujiyoshi, K., Nakatake, S., Kajitani, Y.: VLSI module placement based on rectangle-packing by the sequence-pair. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 15, 1518\u20131524 (1996)","DOI":"10.1109\/43.552084"},{"key":"10_CR26","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1016\/j.asoc.2017.10.028","volume":"68","author":"L M\u00f6nch","year":"2018","unstructured":"M\u00f6nch, L., Roob, S.: A matheuristic framework for batch machine scheduling problems with incompatible job families and regular sum objective. Appl. Soft Comput. 68, 835\u2013846 (2018)","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"10_CR27","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1109\/TCAD.2015.2501293","volume":"35","author":"HC Ou","year":"2016","unstructured":"Ou, H.C., Tseng, K.H., Liu, J.Y., Wu, I.P., Chang, Y.W.: Layout-dependent effects-aware analytical analog placement. IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 35(8), 1243\u20131254 (2016)","journal-title":"IEEE Trans. Comput. Aided Des. Integr. Circuits Syst."},{"issue":"1","key":"10_CR28","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/j.ejor.2021.08.037","volume":"299","author":"S Polyakovskiy","year":"2022","unstructured":"Polyakovskiy, S., M\u2019Hallah, R.: A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem. Eur. J. Oper. Res. 299(1), 104\u2013117 (2022)","journal-title":"Eur. J. Oper. Res."},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.omega.2014.02.003","volume":"46","author":"P Smet","year":"2014","unstructured":"Smet, P., Wauters, T., Mihaylov, M., Vanden Berghe, G.: The shift minimisation personnel task scheduling problem: a new hybrid approach and computational insights. Omega 46, 64\u201373 (2014)","journal-title":"Omega"},{"key":"10_CR30","doi-asserted-by":"crossref","unstructured":"Spindler, P., Schlichtmann, U., Johannes, F.M.: Kraftwerk2-a fast force-directed quadratic placement approach using an accurate net model. IEEE Trans. Comput. Aided Des. Integr. Circ. Syst. 27(8), 1398\u20131411 (2008)","DOI":"10.1109\/TCAD.2008.925783"},{"key":"10_CR31","doi-asserted-by":"crossref","unstructured":"Strasser, M., Eick, M., Grab, H., Schlichtmann, U., Johannes, F.M.: Deterministic analog circuit placement using hierarchically bounded enumeration and enhanced shape functions. In: 2008 IEEE\/ACM International Conference on Computer-Aided Design, pp. 306\u2013313 (2008)","DOI":"10.1109\/ICCAD.2008.4681591"},{"key":"10_CR32","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1016\/j.cor.2017.06.025","volume":"88","author":"Y Xiao","year":"2017","unstructured":"Xiao, Y., Xie, Y., Kulturel-Konak, S., Konak, A.: A problem evolution algorithm with linear programming for the dynamic facility layout problem-a general layout formulation. Comput. Oper. Res. 88, 187\u2013207 (2017)","journal-title":"Comput. Oper. Res."},{"issue":"4","key":"10_CR33","doi-asserted-by":"publisher","first-page":"1016","DOI":"10.1016\/j.compchemeng.2007.05.003","volume":"32","author":"W Xie","year":"2008","unstructured":"Xie, W., Sahinidis, N.V.: A branch-and-bound algorithm for the continuous facility layout problem. Comput. Chem. Eng. 32(4), 1016\u20131028 (2008)","journal-title":"Comput. Chem. Eng."},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"Xu, B., et al.: Device layer-aware analytical placement for analog circuits. In: Proceedings of the 2019 International Symposium on Physical Design, pp. 19\u201326. ISPD 2019 (2019)","DOI":"10.1145\/3299902.3309751"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"Xu, B., Li, S., Xu, X., Sun, N., Pan, D.Z.: Hierarchical and analytical placement techniques for high-performance analog circuits. In: Proceedings of the 2017 ACM on International Symposium on Physical Design, pp. 55\u201362. ISPD 2017 (2017)","DOI":"10.1145\/3036669.3036678"},{"issue":"1","key":"10_CR36","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10732-019-09425-w","volume":"27","author":"F Yang","year":"2021","unstructured":"Yang, F., Leus, R.: Scheduling hybrid flow shops with time windows. J. Heuristics 27(1), 133\u2013158 (2021)","journal-title":"J. Heuristics"}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49662-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,14]],"date-time":"2023-12-14T13:04:40Z","timestamp":1702559080000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49662-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,15]]},"ISBN":["9783031496615","9783031496622"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49662-2_10","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2023,12,15]]},"assertion":[{"value":"15 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICORES","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Operations Research and Enterprise Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Lisbon","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 February 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 February 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icores2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/icores.scitevents.org\/?y=2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}