{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,17]],"date-time":"2026-07-17T19:52:29Z","timestamp":1784317949463,"version":"3.55.0"},"reference-count":31,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":["www.tandfonline.com"],"crossmark-restriction":true},"short-container-title":["INFOR: Information Systems and Operational Research"],"published-print":{"date-parts":[[2024,11,4]]},"DOI":"10.1080\/03155986.2024.2388452","type":"journal-article","created":{"date-parts":[[2024,8,22]],"date-time":"2024-08-22T00:58:14Z","timestamp":1724288294000},"page":"559-572","update-policy":"https:\/\/doi.org\/10.1080\/tandf_crossmark_01","source":"Crossref","is-referenced-by-count":19,"title":["LM4OPT: Unveiling the potential of Large Language Models in formulating mathematical optimization problems"],"prefix":"10.1080","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0799-1180","authenticated-orcid":false,"given":"Tasnim","family":"Ahmed","sequence":"first","affiliation":[{"name":"School of Computing, Queen\u2019s University, Kingston, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Salimur","family":"Choudhury","sequence":"additional","affiliation":[{"name":"School of Computing, Queen\u2019s University, Kingston, Canada"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"301","published-online":{"date-parts":[[2024,8,21]]},"reference":[{"key":"e_1_3_3_2_1","unstructured":"AhmadiTeshnizi A Gao W Udell M. 2023. OptiMUS: optimization modeling using MIP solvers and large language models. ArXiv abs\/2310.06116"},{"key":"e_1_3_3_3_1","doi-asserted-by":"crossref","unstructured":"Ainslie J Lee-Thorp J de Jong M Zemlyanskiy Y Lebr\u00f3n F Sanghai S. 2023. GQA: training generalized multi-query transformer models from multi-head checkpoints. In: Proceedings of the 2023 Conference on Empirical Methods in Natural Language Processing pages 4895\u20134901 Singapore. Association for Computational Linguistics.","DOI":"10.18653\/v1\/2023.emnlp-main.298"},{"key":"e_1_3_3_4_1","unstructured":"Almazrouei E Alobeidli H Alshamsi A Cappelli A Cojocaru R Debbah M \u00c9tienne G Hesslow D Launay J Malartic Q et\u00a0al. 2023. The Falcon Series of Open Language Models. arXiv:2311.16867"},{"key":"e_1_3_3_5_1","unstructured":"Brown TB Mann B Ryder N Subbiah M Kaplan J Dhariwal P Neelakantan A Shyam P Sastry G Askell A et\u00a0al. 2020. Language models are few-shot learners. In: Advances in Neural Information Processing Systems (pp. 1877\u20131901). Curran Associates Inc.."},{"key":"e_1_3_3_6_1","unstructured":"Chen T Xu B Zhang C Guestrin C. 2016. Training deep nets with sublinear memory cost. ArXiv abs\/1604.06174"},{"key":"e_1_3_3_7_1","unstructured":"Child R Gray S Radford A Sutskever I. 2019. Generating long sequences with sparse transformers. arXiv preprint arXiv:1904.10509"},{"key":"e_1_3_3_8_1","unstructured":"Cobbe K Kosaraju V Bavarian M Chen M Jun H Kaiser L Plappert M Tworek J Hilton J Nakano R et\u00a0al. 2021. Training verifiers to solve math word problems. ArXiv abs\/2110.14168"},{"key":"e_1_3_3_9_1","doi-asserted-by":"crossref","unstructured":"Dakle P Kadio\u011flu S Uppuluri K Politi R Raghavan P Rallabandi SK Srinivasamurthy RS. 2023. Ner4Opt: named entity recognition for optimization modelling from natural language. In: Integration of Constraint Programming Artificial Intelligence and Operations Research (pp. 299\u2013319). Springer Nature Switzerland.","DOI":"10.1007\/978-3-031-33271-5_20"},{"key":"e_1_3_3_10_1","first-page":"16344","article-title":"Flashattention: fast and memory-efficient exact attention with io-awareness","volume":"35","author":"Dao T","year":"2022","unstructured":"Dao T, Fu D, Ermon S, Rudra A, R\u00e9 C. 2022. Flashattention: fast and memory-efficient exact attention with io-awareness. Adv Neural Inform Process Syst. 35:16344\u201316359.","journal-title":"Adv Neural Inform Process Syst"},{"key":"e_1_3_3_11_1","unstructured":"Devlin J Chang M-W Lee K Toutanova K. 2019. BERT: pre-training of deep bidirectional transformers for language understanding. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies Volume 1 (Long and Short Papers) (pp. 4171\u20134186). Association for Computational Linguistics."},{"key":"e_1_3_3_12_1","doi-asserted-by":"crossref","unstructured":"Fan Z Ghaddar B Wang X Xing L Zhang Y Zhou Z. 2024. Artificial intelligence for operations research: revolutionizing the operations research process. arXiv:2401.03244","DOI":"10.1080\/03155986.2024.2406729"},{"key":"e_1_3_3_13_1","unstructured":"Hu JE Shen Y Wallis P Allen-Zhu Z Li Y Wang S Chen W. 2022. LoRA: low-Rank Adaptation of Large Language Models. In: International Conference on Learning Representations."},{"key":"e_1_3_3_14_1","unstructured":"Jain N Yeh Chiang P Wen Y Kirchenbauer J Chu H-M Somepalli G Bartoldson B Kailkhura B Schwarzschild A Saha A et\u00a0al. 2024. NEFTune: noisy embeddings improve instruction finetuning. In: The Twelfth International Conference on Learning Representations."},{"key":"e_1_3_3_15_1","unstructured":"Jiang AQ Sablayrolles A Mensch A Bamford C Chaplot DS de las Casas D Bressand F Lengyel G Lample G Saulnier L et\u00a0al. 2023. Mistral 7B. arXiv:2310.06825"},{"key":"e_1_3_3_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579150"},{"key":"e_1_3_3_17_1","doi-asserted-by":"publisher","DOI":"10.1002\/advs.202100707"},{"key":"e_1_3_3_18_1","doi-asserted-by":"crossref","unstructured":"Lewis M Liu Y Goyal N Ghazvininejad M Rahman Mohamed A Levy O Stoyanov V Zettlemoyer L. 2020. BART: denoising sequence-to-sequence pre-training for natural language generation translation and comprehension. In: Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics (pp. 7871\u20137880). Association for Computational Linguistics.","DOI":"10.18653\/v1\/2020.acl-main.703"},{"key":"e_1_3_3_19_1","unstructured":"Li B Mellou K Qing Zhang B Pathuri J Menache I. 2023. Large Language Models for supply chain optimization. ArXiv abs\/2307.03875"},{"key":"e_1_3_3_20_1","unstructured":"Liu H Tam D Muqeeth M Mohta J Huang T Bansal M Raffel C. 2022. Few-shot parameter-efficient fine-tuning is better and cheaper than in-context learning. In: Advances in Neural Information Processing Systems (pp. 1950\u20131965). Curran Associates Inc.."},{"key":"e_1_3_3_21_1","volume-title":"International conference on learning representations","author":"Loshchilov I","year":"2019","unstructured":"Loshchilov I, Hutter F. 2019. Decoupled weight decay regularization. In: International conference on learning representations."},{"key":"e_1_3_3_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/5992.814654"},{"key":"e_1_3_3_23_1","unstructured":"OpenAI. 2023. GPT-4 technical report. ArXivabs\/2303.08774"},{"key":"e_1_3_3_24_1","unstructured":"Ramamonjison R Yu TT Li R Li H Carenini G Ghaddar B He S Mostajabdaveh M Banitalebi-Dehkordi A Zhou Z et\u00a0al. 2021. NL4Opt competition: formulating optimization problems based on their natural language descriptions. In: NeurIPS (Competition and Demos) (pp. 189-203)."},{"key":"e_1_3_3_25_1","article-title":"Fast transformer decoding: one write-head is all you need","author":"Shazeer N.","year":"2019","unstructured":"Shazeer N. 2019. Fast transformer decoding: one write-head is all you need. arXiv Preprint. arXiv:1911.02150","journal-title":"arXiv Preprint"},{"key":"e_1_3_3_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2023.127063"},{"key":"e_1_3_3_27_1","volume-title":"Annual Meeting of the Association for Computational Linguistics","author":"Suzgun M","year":"2022","unstructured":"Suzgun M, Scales N, Scharli N, Gehrmann S, Tay Y, Chung HW, Chowdhery A, Le QV, Hsin Chi EH, Zhou D, et\u00a0al. 2022. Challenging BIG-Bench tasks and whether chain-of-thought can solve them. In: Annual Meeting of the Association for Computational Linguistics."},{"key":"e_1_3_3_28_1","unstructured":"Touvron H Martin L Stone K Albert P Almahairi A Babaei Y Bashlykov N Batra S Bhargava P Bhosale S et\u00a0al. 2023. Llama 2: open foundation and fine-tuned chat models. arXiv:2307.09288"},{"key":"e_1_3_3_29_1","unstructured":"Tsouros DC Verhaeghe H Kadiouglu S Guns T. 2023. Holy grail 2.0: from natural language to constraint models. ArXivabs\/2308.01589"},{"key":"e_1_3_3_30_1","unstructured":"Tunstall L Beeching E Lambert N Rajani N Rasul K Belkada Y Huang S von Werra L Fourrier C Habib N et\u00a0al. 2023. Zephyr: direct distillation of LM alignment. arXiv:2310.16944"},{"key":"e_1_3_3_31_1","article-title":"Attention is all you need","author":"Vaswani A","year":"2017","unstructured":"Vaswani A, Shazeer NM, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser L, Polosukhin I. 2017. Attention is all you need. In Neural information processing systems.","journal-title":"Neural information processing systems"},{"key":"e_1_3_3_32_1","unstructured":"Yang C Wang X Lu Y Liu H Le QV Zhou D Chen X. 2024. Large Language Models as optimizers. In: The Twelfth International Conference on Learning Representations."}],"container-title":["INFOR: Information Systems and Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/03155986.2024.2388452","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,14]],"date-time":"2024-11-14T17:21:00Z","timestamp":1731604860000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.tandfonline.com\/doi\/full\/10.1080\/03155986.2024.2388452"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,21]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2024,11,4]]}},"alternative-id":["10.1080\/03155986.2024.2388452"],"URL":"https:\/\/doi.org\/10.1080\/03155986.2024.2388452","relation":{},"ISSN":["0315-5986","1916-0615"],"issn-type":[{"value":"0315-5986","type":"print"},{"value":"1916-0615","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,8,21]]},"assertion":[{"value":"The publishing and review policy for this title is described in its Aims & Scope.","order":1,"name":"peerreview_statement","label":"Peer Review Statement"},{"value":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","URL":"http:\/\/www.tandfonline.com\/action\/journalInformation?show=aimsScope&journalCode=tinf20","order":2,"name":"aims_and_scope_url","label":"Aim & Scope"},{"value":"2023-12-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-19","order":1,"name":"revised","label":"Revised","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-07-30","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-08-21","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}