{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,24]],"date-time":"2025-04-24T04:03:30Z","timestamp":1745467410190,"version":"3.40.4"},"publisher-location":"Cham","reference-count":70,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031900648","type":"print"},{"value":"9783031900655","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-90065-5_22","type":"book-chapter","created":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:30Z","timestamp":1745377710000},"page":"353-371","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Probing LLMs on\u00a0Optimization Problems: Can They Recall and\u00a0Interpret Problem Features?"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7026-4165","authenticated-orcid":false,"given":"Francesca","family":"Da Ros","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0299-6086","authenticated-orcid":false,"given":"Luca","family":"Di Gaspero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9191-3280","authenticated-orcid":false,"given":"Kevin","family":"Roitero","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,4,17]]},"reference":[{"key":"22_CR1","doi-asserted-by":"publisher","unstructured":"Achiam, J., et\u00a0al.: GPT-4 technical report. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.08774","DOI":"10.48550\/arXiv.2303.08774"},{"key":"22_CR2","doi-asserted-by":"publisher","unstructured":"Ahmadi-Teshnizi, A., Gao, W., Udell, M.: OptiMUS: scalable optimization modeling with (MI)LP solvers and large language models. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.10172","DOI":"10.48550\/arXiv.2402.10172"},{"key":"22_CR3","doi-asserted-by":"publisher","unstructured":"Akbay, M.A., Blum, C., Saliba, M.: The electric vehicle problem with road junctions and road types: an ant colony optimization approach. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201924, pp. 1454\u20131462, New York, NY, USA. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638529.3653997","DOI":"10.1145\/3638529.3653997"},{"key":"22_CR4","doi-asserted-by":"publisher","unstructured":"Almonacid, B.: Towards an automatic optimisation model generator assisted with generative pre-trained transformer. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2305.05811","DOI":"10.48550\/arXiv.2305.05811"},{"key":"22_CR5","doi-asserted-by":"publisher","unstructured":"Amarasinghe, P.T., Nguyen, S., Sun, Y., Alahakoon, D.: AI-copilot for business optimisation: a framework and a case study in production scheduling. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2309.13218","DOI":"10.48550\/arXiv.2309.13218"},{"issue":"2","key":"22_CR6","doi-asserted-by":"publisher","first-page":"405","DOI":"10.1016\/j.ejor.2020.07.063","volume":"290","author":"Y Bengio","year":"2021","unstructured":"Bengio, Y., Lodi, A., Prouvost, A.: Machine learning for combinatorial optimization: a methodological tour d\u2019horizon. Eur. J. Oper. Res. 290(2), 405\u2013421 (2021). https:\/\/doi.org\/10.1016\/j.ejor.2020.07.063","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"22_CR7","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/s11590-006-0011-8","volume":"1","author":"M Birattari","year":"2007","unstructured":"Birattari, M., Dorigo, M.: How to assess and report the performance of a stochastic algorithm on a benchmark problem: mean or best result on a number of runs? Optim. Lett. 1(3), 309\u2013311 (2007). https:\/\/doi.org\/10.1007\/s11590-006-0011-8","journal-title":"Optim. Lett."},{"key":"22_CR8","doi-asserted-by":"publisher","unstructured":"Bresich, M., Raidl, G.R., Limmer, S.: Letting a large neighborhood search for an electric dial-a-ride problem fly: on-the-fly charging station insertion. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201924, New York, NY, USA, pp. 142\u2013150. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638529.3654057","DOI":"10.1145\/3638529.3654057"},{"key":"22_CR9","unstructured":"Brown, T., et al.: Language models are few-shot learners. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 1877\u20131901. Curran Associates, Inc. (2020). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2020\/file\/1457c0d6bfcb4967418bfb8ac142f64a-Paper.pdf"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2022.07.011","volume":"308","author":"S Ceschia","year":"2023","unstructured":"Ceschia, S., Di Gaspero, L., Schaerf, A.: Educational timetabling: problems, benchmarks, and state-of-the-art results. Eur. J. Oper. Res. 308(1), 1\u201318 (2023). https:\/\/doi.org\/10.1016\/j.ejor.2022.07.011","journal-title":"Eur. J. Oper. Res."},{"key":"22_CR11","doi-asserted-by":"publisher","unstructured":"Chaudhury, S., Dan, S., Das, P., Kollias, G., Nelson, E.: Needle in the haystack for memory based large language models. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.01437","DOI":"10.48550\/arXiv.2407.01437"},{"key":"22_CR12","doi-asserted-by":"publisher","unstructured":"Chen, H., Constante-Flores, G.E., Li, C.: Diagnosing infeasible optimization problems using large language models. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.12923","DOI":"10.48550\/arXiv.2308.12923"},{"key":"22_CR13","doi-asserted-by":"publisher","unstructured":"Chin, S.J.K., Winkenbach, M., Srivastava, A.: Learning to deliver: a foundation model for the montreal capacitated vehicle routing problem. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2403.00026","DOI":"10.48550\/arXiv.2403.00026"},{"key":"22_CR14","doi-asserted-by":"publisher","unstructured":"Conforti, M., Cornu\u00e9jols, G., Zambelli, G.: Integer Programming. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11008-0","DOI":"10.1007\/978-3-319-11008-0"},{"key":"22_CR15","doi-asserted-by":"publisher","unstructured":"Dang, N., Akg\u00fcn, O., Espasa, J., Miguel, I., Nightingale, P.: A framework for generating informative benchmark instances. In: Solnon, C. (ed.) 28th International Conference on Principles and Practice of Constraint Programming (CP 2022), Leibniz International Proceedings in Informatics (LIPIcs), vol. 235, pp. 18:1\u201318:18, Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik, Dagstuhl, Germany (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2022.18","DOI":"10.4230\/LIPIcs.CP.2022.18"},{"key":"22_CR16","doi-asserted-by":"publisher","unstructured":"Fan, Z., Ghaddar, B., Wang, X., Xing, L., Zhang, Y., Zhou, Z.: Artificial intelligence for operations research: revolutionizing the operations research process. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.03244","DOI":"10.48550\/arXiv.2401.03244"},{"key":"22_CR17","unstructured":"Ge, Y., et al.: Openagi: when LLM meets domain experts. In: Oh, A., Naumann, T., Globerson, A., Saenko, K., Hardt, M., Levine, S. (eds.) Advances in Neural Information Processing Systems, vol.\u00a036, pp. 5539\u20135568. Curran Associates, Inc. (2023). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2023\/file\/1190733f217404edc8a7f4e15a57f301-Paper-Datasets_and_Benchmarks.pdf"},{"key":"22_CR18","doi-asserted-by":"publisher","unstructured":"Glover, F.: Tabu Search. Springer, New York (1997). https:\/\/doi.org\/10.1007\/978-1-4615-6089-0","DOI":"10.1007\/978-1-4615-6089-0"},{"issue":"1\u20132","key":"22_CR19","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1016\/S0004-3702(00)00083-0","volume":"126","author":"CP Gomes","year":"2001","unstructured":"Gomes, C.P., Selman, B.: Algorithm portfolios. Artif. Intell. 126(1\u20132), 43\u201362 (2001). https:\/\/doi.org\/10.1016\/S0004-3702(00)00083-0","journal-title":"Artif. Intell."},{"key":"22_CR20","doi-asserted-by":"publisher","unstructured":"He, J., N, M., Vignesh, S., Kumar, D., Uppal, A.: Linear programming word problems formulation using EnsembleCRF NER labeler and text generator with data augmentations. arXiv (2022). https:\/\/doi.org\/10.48550\/arXiv.2212.14657","DOI":"10.48550\/arXiv.2212.14657"},{"key":"22_CR21","doi-asserted-by":"publisher","unstructured":"Huang, L., et\u00a0al.: A survey on hallucination in large language models: principles, taxonomy, challenges, and open questions. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.05232","DOI":"10.48550\/arXiv.2311.05232"},{"key":"22_CR22","doi-asserted-by":"publisher","unstructured":"Huang, S., Yang, K., Qi, S., Wang, R.: When large language model meets optimization. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2405.10098","DOI":"10.48550\/arXiv.2405.10098"},{"key":"22_CR23","doi-asserted-by":"publisher","unstructured":"Huang, Y., Zhang, W., Feng, L., Wu, X., Tan, K.C.: How multimodal integration boost the performance of LLM for optimization: case study on capacitated vehicle routing problems. arXiv (2024).https:\/\/doi.org\/10.48550\/arXiv.2403.01757","DOI":"10.48550\/arXiv.2403.01757"},{"key":"22_CR24","doi-asserted-by":"publisher","unstructured":"Huang, Z., Shi, G., Sukhatme, G.S.: From words to routes: applying large language models to vehicle routing. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2403.10795","DOI":"10.48550\/arXiv.2403.10795"},{"key":"22_CR25","doi-asserted-by":"publisher","unstructured":"Jang, S.: Tag embedding and well-defined intermediate representation improve auto-formulation of problem description. arXiv (2022). https:\/\/doi.org\/10.48550\/arXiv.2212.03575","DOI":"10.48550\/arXiv.2212.03575"},{"key":"22_CR26","doi-asserted-by":"publisher","unstructured":"Jiang, A.Q., et\u00a0al.: Mistral 7b. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2310.06825","DOI":"10.48550\/arXiv.2310.06825"},{"key":"22_CR27","doi-asserted-by":"publisher","DOI":"10.1090\/dimacs\/026","volume-title":"Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993","author":"DJ Johnson","year":"1996","unstructured":"Johnson, D.J., Trick, M.A.: Cliques, Coloring, and Satisfiability: Second DIMACS Implementation Challenge, Workshop, October 11\u201313, 1993. American Mathematical Society, USA (1996)"},{"key":"22_CR28","unstructured":"Kamradt, G.: Needle in a Haystack - Pressure Testing LLMs. GitHub (2023). https:\/\/github.com\/gkamradt\/LLMTest_NeedleInAHaystack\/tree\/main"},{"key":"22_CR29","doi-asserted-by":"publisher","unstructured":"Kikuta, D., Ikeuchi, H., Tajiri, K., Nakano, Y.: RouteExplainer: an explanation framework for vehicle routing problem. In: Yang, D.N., Xie, X., Tseng, V.S., Pei, J., Huang, J.W., Lin, J.C.W. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 30\u201342. Springer, Singapore (2024). https:\/\/doi.org\/10.1007\/978-981-97-2259-4_3","DOI":"10.1007\/978-981-97-2259-4_3"},{"issue":"4598","key":"22_CR30","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt, D., Vecchi, M.P.: Optimization by simulated annealing. Science 220(4598), 671\u2013680 (1983). https:\/\/doi.org\/10.1126\/science.220.4598.671","journal-title":"Science"},{"key":"22_CR31","doi-asserted-by":"publisher","unstructured":"Kuratov, Y., et al.: Babilong: testing the limits of LLMs with long context reasoning-in-a-haystack. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.10149","DOI":"10.48550\/arXiv.2406.10149"},{"key":"22_CR32","doi-asserted-by":"publisher","unstructured":"Laban, P., Fabbri, A.R., Xiong, C., Wu, C.S.: Summary of a haystack: a challenge to long-context LLMs and rag systems. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2407.01370","DOI":"10.48550\/arXiv.2407.01370"},{"key":"22_CR33","doi-asserted-by":"publisher","unstructured":"Lackner, M.L., Mrkvicka, C., Musliu, N., Walkiewicz, D., Winter, F.: Exact methods for the oven scheduling problem. Constraints 28(2), 320\u2013361 (2023). https:\/\/doi.org\/10.1007\/s10601-023-09347-2","DOI":"10.1007\/s10601-023-09347-2"},{"key":"22_CR34","doi-asserted-by":"publisher","unstructured":"Lawless, C., et al.: \u201cI Want It That Way\u201d: enabling interactive decision support using large language models and constraint programming. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2312.06908","DOI":"10.48550\/arXiv.2312.06908"},{"key":"22_CR35","doi-asserted-by":"publisher","unstructured":"Li, B., Mellou, K., Zhang, B., Pathuri, J., Menache, I.: Large language models for supply chain optimization. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2307.03875","DOI":"10.48550\/arXiv.2307.03875"},{"key":"22_CR36","doi-asserted-by":"publisher","unstructured":"Liu, F., et al.: Large language model for multi-objective evolutionary optimization. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2310.12541","DOI":"10.48550\/arXiv.2310.12541"},{"key":"22_CR37","doi-asserted-by":"publisher","unstructured":"Liu, F., et al.: Evolution of heuristics: towards efficient automatic algorithm design using large language model. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.02051","DOI":"10.48550\/arXiv.2401.02051"},{"key":"22_CR38","doi-asserted-by":"publisher","unstructured":"Liu, F., Tong, X., Yuan, M., Zhang, Q.: Algorithm evolution using large language model. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2311.15249","DOI":"10.48550\/arXiv.2311.15249"},{"key":"22_CR39","doi-asserted-by":"publisher","unstructured":"Liu, S., Chen, C., Qu, X., Tang, K., Ong, Y.S.: Large language models as evolutionary optimizers. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2310.19046","DOI":"10.48550\/arXiv.2310.19046"},{"key":"22_CR40","doi-asserted-by":"publisher","unstructured":"Mao, J., et al.: Identify critical nodes in complex network with large language models. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2403.03962","DOI":"10.48550\/arXiv.2403.03962"},{"key":"22_CR41","doi-asserted-by":"publisher","unstructured":"Marrero, A., Segredo, E., Le\u00f3n, C., Hart, E.: Learning descriptors for novelty-search based instance generation via meta-evolution. In: Proceedings of the Genetic and Evolutionary Computation Conference, GECCO \u201924, New York, NY, USA, pp. 206\u2013213. Association for Computing Machinery (2024). https:\/\/doi.org\/10.1145\/3638529.3654028","DOI":"10.1145\/3638529.3654028"},{"key":"22_CR42","doi-asserted-by":"publisher","unstructured":"Meadows, J., Freitas, A.: A survey in mathematical language processing. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2205.15231","DOI":"10.48550\/arXiv.2205.15231"},{"key":"22_CR43","doi-asserted-by":"publisher","unstructured":"Moser, M., Musliu, N., Schaerf, A., Winter, F.: Exact and metaheuristic approaches for unrelated parallel machine scheduling. J. Schedul. 25(5), 507\u2013534 (2022). https:\/\/doi.org\/10.1007\/s10951-021-00714-6","DOI":"10.1007\/s10951-021-00714-6"},{"key":"22_CR44","unstructured":"Ni, A., et al.: LEVER: learning to verify language-to-code generation with execution. In: Krause, A., Brunskill, E., Cho, K., Engelhardt, B., Sabato, S., Scarlett, J. (eds.) Proceedings of the 40th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 202, pp. 26106\u201326128. PMLR (2023). https:\/\/proceedings.mlr.press\/v202\/ni23b.html"},{"key":"22_CR45","doi-asserted-by":"publisher","unstructured":"Ochoa, G., Malan, K.M., Blum, C.: Search trajectory networks: a tool for analysing and visualising the behaviour of metaheuristics. Appl. Soft Comput.109, 107492 (2021). https:\/\/doi.org\/10.1016\/j.asoc.2021.107492","DOI":"10.1016\/j.asoc.2021.107492"},{"key":"22_CR46","unstructured":"Ouyang, L., et al.: Training language models to follow instructions with human feedback. In: Proceedings of the 36th International Conference on Neural Information Processing Systems, NIPS \u201922, Curran Associates Inc., Red Hook, NY, USA (2024). https:\/\/proceedings.neurips.cc\/paper_files\/paper\/2022\/file\/b1efde53be364a73914f58805a001731-Paper-Conference.pdf"},{"key":"22_CR47","unstructured":"Radford, A., et\u00a0al.: Language models are unsupervised multitask learners. OpenAI Blog 1(8), 9 (2019). https:\/\/cdn.openai.com\/better-language-models\/language_models_are_unsupervised_multitask_learners.pdf"},{"key":"22_CR48","doi-asserted-by":"publisher","unstructured":"Ramamonjison, R., et al.: Augmenting operations research with auto-formulation of optimization models from problem descriptions. In: Li, Y., Lazaridou, A. (eds.) Proceedings of the 2022 Conference on Empirical Methods in Natural Language Processing: Industry Track, Abu Dhabi, UAE, pp. 29\u201362. Association for Computational Linguistics (2022). https:\/\/doi.org\/10.18653\/v1\/2022.emnlp-industry.4","DOI":"10.18653\/v1\/2022.emnlp-industry.4"},{"key":"22_CR49","doi-asserted-by":"publisher","unstructured":"Ramamonjison, R., et al.: NL4Opt competition: formulating optimization problems based on their natural language descriptions. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2303.08233","DOI":"10.48550\/arXiv.2303.08233"},{"key":"22_CR50","doi-asserted-by":"publisher","unstructured":"Romanko, O., Narayan, A., Kwon, R.H.: ChatGPT-based investment portfolio selection. SN Oper. Res. Forum 4(4), 1\u201327 (2023). https:\/\/doi.org\/10.1007\/s43069-023-00277-6","DOI":"10.1007\/s43069-023-00277-6"},{"key":"22_CR51","doi-asserted-by":"publisher","unstructured":"Romera-Paredes, B., et al.: Mathematical discoveries from program search with large language models. Nature 625(7995), 468\u2013475 (2024). https:\/\/doi.org\/10.1038\/s41586-023-06924-6","DOI":"10.1038\/s41586-023-06924-6"},{"key":"22_CR52","unstructured":"Rossi, F., Van\u00a0Beek, P., Walsh, T.: Handbook of constraint programming. Elsevier, Amsterdam (2006). https:\/\/www.dcs.gla.ac.uk\/~pat\/cpM\/papers\/CP_Handbook-20060315-final.pdf"},{"key":"22_CR53","doi-asserted-by":"publisher","unstructured":"Saka, A., et al.: GPT models in construction industry: opportunities, limitations, and a use case validation. Dev. Built Environ. 17, 100300 (2024). https:\/\/doi.org\/10.1016\/j.dibe.2023.100300","DOI":"10.1016\/j.dibe.2023.100300"},{"key":"22_CR54","doi-asserted-by":"publisher","unstructured":"Sartori, C.C., Blum, C., Ochoa, G.: Large language models for the automated analysis of optimization algorithms. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.08472","DOI":"10.48550\/arXiv.2402.08472"},{"key":"22_CR55","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Bowly, S.: Generating new test instances by evolving in instance space. Comput. Oper. Res. 63, 102\u2013113 (2015). https:\/\/doi.org\/10.1016\/j.cor.2015.04.022","DOI":"10.1016\/j.cor.2015.04.022"},{"key":"22_CR56","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Christiansen, J., Mu\u00f1oz, M.A.: Revisiting where are the hard knapsack problems? via instance space analysis. Comput. Oper. Res. 128, 105184 (2021). https:\/\/doi.org\/10.1016\/j.cor.2020.105184","DOI":"10.1016\/j.cor.2020.105184"},{"key":"22_CR57","doi-asserted-by":"publisher","unstructured":"Smith-Miles, K., Mu\u00f1oz, M.A.: Instance space analysis for algorithm testing: methodology and software tools. ACM Comput. Surv. 55(12) (2023). https:\/\/doi.org\/10.1145\/3572895","DOI":"10.1145\/3572895"},{"key":"22_CR58","doi-asserted-by":"publisher","unstructured":"Steiner, E., Pferschy, U., Schaerf, A.: Curriculum-based university course timetabling considering individual course of studies. Central Eur. J. Oper. Res. (2024). https:\/\/doi.org\/10.1007\/s10100-024-00923-2","DOI":"10.1007\/s10100-024-00923-2"},{"key":"22_CR59","doi-asserted-by":"publisher","unstructured":"Sui, P., Duede, E., Wu, S., So, R.: Confabulation: the surprising value of large language model hallucinations. In: Ku, L.W., Martins, A., Srikumar, V. (eds.) Proceedings of the 62nd Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), Bangkok, Thailand, pp. 14274\u201314284. Association for Computational Linguistics (2024). https:\/\/doi.org\/10.18653\/v1\/2024.acl-long.770","DOI":"10.18653\/v1\/2024.acl-long.770"},{"key":"22_CR60","doi-asserted-by":"publisher","unstructured":"Talbi, E.G.: Machine learning into metaheuristics: a survey and taxonomy. ACM Comput. Surv. 54(6) (2021). https:\/\/doi.org\/10.1145\/3459664","DOI":"10.1145\/3459664"},{"key":"22_CR61","doi-asserted-by":"publisher","unstructured":"Teukam, N.Y., Zipoli, F., Laino, T., Criscuolo, E., Grisoni, F., Manica, M.: Integrating genetic algorithms and language models for enhanced enzyme design. ChemRxiv (2024). https:\/\/doi.org\/10.26434\/chemrxiv-2024-j7ntq","DOI":"10.26434\/chemrxiv-2024-j7ntq"},{"key":"22_CR62","doi-asserted-by":"publisher","unstructured":"Touvron, H., et\u00a0al.: Llama 2: open foundation and fine-tuned chat models. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2307.09288","DOI":"10.48550\/arXiv.2307.09288"},{"key":"22_CR63","doi-asserted-by":"publisher","unstructured":"Tsouros, D., Verhaeghe, H., Kad\u0131o\u011flu, S., Guns, T.: Holy Grail 2.0: from natural language to constraint models. arXiv (2023). https:\/\/doi.org\/10.48550\/arXiv.2308.01589","DOI":"10.48550\/arXiv.2308.01589"},{"key":"22_CR64","doi-asserted-by":"publisher","unstructured":"Wang, H., et al.: Multimodal needle in a haystack: benchmarking long-context capability of multimodal large language models. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.11230","DOI":"10.48550\/arXiv.2406.11230"},{"key":"22_CR65","doi-asserted-by":"publisher","unstructured":"Wei, J., et al.: Finetuned language models are zero-shot learners. arXiv (2021). https:\/\/doi.org\/10.48550\/arXiv.2109.01652","DOI":"10.48550\/arXiv.2109.01652"},{"key":"22_CR66","doi-asserted-by":"publisher","unstructured":"Wu, X., Wu, S.H., Wu, J., Feng, L., Tan, K.C.: Evolutionary computation in the era of large language model: survey and roadmap. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2401.10034","DOI":"10.48550\/arXiv.2401.10034"},{"key":"22_CR67","unstructured":"Xiao, Z., et al.: Chain-of-experts: when LLMs meet complex operations research problems. In: The Twelfth International Conference on Learning Representations (ICLR 2024), OpenReview, Virtual Conference (2024). https:\/\/openreview.net\/forum?id=HobyL1B9CZ"},{"key":"22_CR68","doi-asserted-by":"publisher","unstructured":"Xiong, Z., Papageorgiou, V., Lee, K., Papailiopoulos, D.: From artificial needles to real haystacks: improving retrieval capabilities in LLMs by finetuning on synthetic data. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2406.19292","DOI":"10.48550\/arXiv.2406.19292"},{"key":"22_CR69","doi-asserted-by":"publisher","unstructured":"Yang, C., et al.: Large language models as optimizers. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2309.03409","DOI":"10.48550\/arXiv.2309.03409"},{"key":"22_CR70","doi-asserted-by":"publisher","unstructured":"Ye, H., et al.: Large language models as hyper-heuristics for combinatorial optimization. arXiv (2024). https:\/\/doi.org\/10.48550\/arXiv.2402.01145","DOI":"10.48550\/arXiv.2402.01145"}],"container-title":["Lecture Notes in Computer Science","Applications of Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-90065-5_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,23]],"date-time":"2025-04-23T03:08:49Z","timestamp":1745377729000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-90065-5_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031900648","9783031900655"],"references-count":70,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-90065-5_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"17 April 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"EvoApplications","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on the Applications of Evolutionary Computation (Part of EvoStar)","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Trieste","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23 April 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 April 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"evoapplications2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.evostar.org\/2025\/evoapps\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}