{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,18]],"date-time":"2026-03-18T23:18:05Z","timestamp":1773875885489,"version":"3.50.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T00:00:00Z","timestamp":1686009600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CBET-1554018"],"award-info":[{"award-number":["CBET-1554018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CBET-1554018"],"award-info":[{"award-number":["CBET-1554018"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper. Res. Forum"],"DOI":"10.1007\/s43069-023-00224-5","type":"journal-article","created":{"date-parts":[[2023,6,6]],"date-time":"2023-06-06T04:01:29Z","timestamp":1686024089000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":14,"title":["Learning Optimal Solutions via an LSTM-Optimization Framework"],"prefix":"10.1007","volume":"4","author":[{"given":"Dogacan","family":"Yilmaz","sequence":"first","affiliation":[]},{"given":"\u0130. Esra","family":"B\u00fcy\u00fcktahtak\u0131n","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,6,6]]},"reference":[{"key":"224_CR1","unstructured":"Gicquel C, Minoux M, Dallery Y (2008) Capacitated lot sizing models: A literature review"},{"issue":"5","key":"224_CR2","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1016\/S0305-0483(03)00059-8","volume":"31","author":"B Karimi","year":"2003","unstructured":"Karimi B, Ghomi SF, Wilson J (2003) The capacitated lot sizing problem: a review of models and algorithms. Omega 31(5):365\u2013378","journal-title":"Omega"},{"issue":"10","key":"224_CR3","doi-asserted-by":"publisher","first-page":"1174","DOI":"10.1287\/mnsc.28.10.1174","volume":"28","author":"GR Bitran","year":"1982","unstructured":"Bitran GR, Yanasse HH (1982) Computational complexity of the capacitated lot size problem. Manag Sci 28(10):1174\u20131186","journal-title":"Manag Sci"},{"issue":"12","key":"224_CR4","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1080\/0740817X.2010.504683","volume":"42","author":"JC Hartman","year":"2010","unstructured":"Hartman JC, B\u00fcy\u00fcktahtak\u0131n \u0130E, Smith JC (2010) Dynamic-programming-based inequalities for the capacitated lot-sizing problem. IIE Trans 42(12):915\u2013930","journal-title":"IIE Trans"},{"key":"224_CR5","doi-asserted-by":"publisher","first-page":"1735","DOI":"10.1162\/neco.1997.9.8.1735","volume":"9","author":"S Hochreiter","year":"1997","unstructured":"Hochreiter S, Schmidhuber J (1997) Long short-term memory. Neural Comput 9:1735\u201380","journal-title":"Neural Comput"},{"key":"224_CR6","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1109\/72.279181","volume":"5","author":"Y Bengio","year":"1994","unstructured":"Bengio Y, Simard P, Frasconi P (1994) Learning long-term dependencies with gradient descent is difficult. IEEE Transactions on Neural Networks \/ a Publication of the IEEE Neural Networks Council 5:157\u201366","journal-title":"IEEE Transactions on Neural Networks \/ a Publication of the IEEE Neural Networks Council"},{"key":"224_CR7","doi-asserted-by":"publisher","first-page":"2673","DOI":"10.1109\/78.650093","volume":"45","author":"M Schuster","year":"1997","unstructured":"Schuster M, Paliwal K (1997) Bidirectional recurrent neural networks. Signal Processing, IEEE Transactions on 45:2673\u20132681","journal-title":"Signal Processing, IEEE Transactions on"},{"key":"224_CR8","doi-asserted-by":"crossref","unstructured":"Graves A, Schmidhuber J (2005) Framewise phoneme classification with bidirectional LSTM networks. In: Proceedings. 2005 IEEE International Joint Conference on Neural Networks, vol 4. pp 2047\u20132052","DOI":"10.1109\/IJCNN.2005.1556215"},{"issue":"1","key":"224_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1287\/ijoc.11.1.15","volume":"11","author":"KA Smith","year":"1999","unstructured":"Smith KA (1999) Neural networks for combinatorial optimization: A review of more than a decade of research. INFORMS J Comput 11(1):15\u201334","journal-title":"INFORMS J Comput"},{"key":"224_CR10","doi-asserted-by":"crossref","unstructured":"Larsen E, Lachapelle S, Bengio Y, Frejinger E, Lacoste-Julien S, Lodi A (2021) Predicting tactical solutions to operational planning problems under imperfect information. INFORMS J Comput","DOI":"10.1287\/ijoc.2021.1091"},{"key":"224_CR11","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/j.cor.2018.04.006","volume":"106","author":"M Fischetti","year":"2019","unstructured":"Fischetti M, Fraccaro M (2019) Machine learning meets mathematical optimization to predict the optimal production of offshore wind parks. Comput Oper Res 106:289\u2013297","journal-title":"Comput Oper Res"},{"key":"224_CR12","unstructured":"Bertsimas D, Stellato B (2019) Online mixed-integer optimization in milliseconds. arXiv preprint arXiv:1907.02206"},{"key":"224_CR13","doi-asserted-by":"crossref","unstructured":"Bushaj S, B\u00fcy\u00fcktahtak\u0131n \u0130E (2023) A K-means supported reinforcement learning algorithm to solve multi-dimensional knapsack problem. Under Review","DOI":"10.1007\/s10898-024-01364-6"},{"key":"224_CR14","doi-asserted-by":"crossref","unstructured":"Bushaj S, Yin X, Beqiri A, Andrews D, B\u00fcy\u00fcktahtak\u0131n \u0130E (2022) A simulation-deep reinforcement learning (SiRL) approach for epidemic control optimization. Ann Oper Res 1\u201333","DOI":"10.1007\/s10479-022-04926-7"},{"key":"224_CR15","doi-asserted-by":"crossref","unstructured":"Yilmaz D, B\u00fcy\u00fcktahtak\u0131n \u0130E (2023) A deep reinforcement learning framework for solving two-stage stochastic programs. Accepted for Publication in Optimization Letters","DOI":"10.1007\/s11590-023-02009-5"},{"issue":"4","key":"224_CR16","doi-asserted-by":"publisher","first-page":"444","DOI":"10.1080\/24725854.2019.1632502","volume":"52","author":"A Oroojlooyjadid","year":"2019","unstructured":"Oroojlooyjadid A, Snyder LV, Tak\u00e1\u010d M (2019) Applying deep learning to the newsvendor problem. IISE Transactions 52(4):444\u2013463","journal-title":"IISE Transactions"},{"key":"224_CR17","doi-asserted-by":"crossref","unstructured":"Khalil EB, Bodic PL, Song L, Nemhauser G, Dilkina B (2016) Learning to branch in mixed integer programming. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI\u201916, page 724\u2013731. AAAI Press","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"224_CR18","doi-asserted-by":"crossref","unstructured":"Khalil EB, Dilkina B, Nemhauser GL, Ahmed S, Shao Y (2017) Learning to run heuristics in tree search. In Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, IJCAI-17 pages 659\u2013666","DOI":"10.24963\/ijcai.2017\/92"},{"issue":"2","key":"224_CR19","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/s11750-017-0451-6","volume":"25","author":"A Lodi","year":"2017","unstructured":"Lodi A, Zarpellon G (2017) On learning and branching: a survey. TOP 25(2):207\u2013236","journal-title":"TOP"},{"key":"224_CR20","doi-asserted-by":"crossref","unstructured":"Xavier AS, Qiu F, Ahmed S (2019) Learning to solve large-scale security-constrained unit commitment problems","DOI":"10.1287\/ijoc.2020.0976"},{"key":"224_CR21","doi-asserted-by":"crossref","unstructured":"Kruber M, L\u00fcbbecke M, Parmentier A (2017) Learning when to use a decomposition. pages 202\u2013210","DOI":"10.1007\/978-3-319-59776-8_16"},{"key":"224_CR22","doi-asserted-by":"publisher","first-page":"595","DOI":"10.1007\/978-3-319-93031-2_43","volume-title":"Integration of Constraint Programming, Artificial Intelligence, and Operations Research","author":"P Bonami","year":"2018","unstructured":"Bonami P, Lodi A, Zarpellon G (2018) Learning a classification of mixed-integer quadratic programming problems. In: van Hoeve WJ (ed) Integration of Constraint Programming, Artificial Intelligence, and Operations Research. Cham. Springer International Publishing, pp 595\u2013604"},{"issue":"7","key":"224_CR23","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1287\/mnsc.26.7.669","volume":"26","author":"M Florian","year":"1980","unstructured":"Florian M, Lenstra JK, Rinnooy Kan A (1980) Deterministic production planning: Algorithms and complexity. Manag Sci 26(7):669\u2013679","journal-title":"Manag Sci"},{"issue":"10","key":"224_CR24","doi-asserted-by":"publisher","first-page":"1255","DOI":"10.1287\/mnsc.30.10.1255","volume":"30","author":"I Barany","year":"1984","unstructured":"Barany I, Van Roy TJ, Wolsey LA (1984) Strong formulations for multi-item capacitated lot sizing. Manag Sci 30(10):1255\u20131261","journal-title":"Manag Sci"},{"issue":"6","key":"224_CR25","doi-asserted-by":"publisher","first-page":"832","DOI":"10.1287\/opre.35.6.832","volume":"35","author":"GD Eppen","year":"1987","unstructured":"Eppen GD, Martin RK (1987) Solving multi-item capacitated lot-sizing problems using variable redefinition. Oper Res 35(6):832\u2013848","journal-title":"Oper Res"},{"key":"224_CR26","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/j.cor.2017.11.006","volume":"91","author":"\u0130E B\u00fcy\u00fcktahtak\u0131n","year":"2018","unstructured":"B\u00fcy\u00fcktahtak\u0131n \u0130E, Smith JC, Hartman JC (2018) Partial objective inequalities for the multi-item capacitated lot-sizing problem. Comput Oper Res 91:132\u2013144","journal-title":"Comput Oper Res"},{"key":"224_CR27","unstructured":"Pochet Y, Wolsey LA (2006) Production planning by mixed integer programming. Springer Science & Business Media"},{"key":"224_CR28","unstructured":"Goodfellow I, Bengio Y, Courville A (2016) Deep Learning. MIT Press. http:\/\/www.deeplearningbook.org"},{"key":"224_CR29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24797-2","volume-title":"Supervised Sequence Labelling with Recurrent Neural Networks","author":"A Graves","year":"2012","unstructured":"Graves A (2012) Supervised Sequence Labelling with Recurrent Neural Networks. Springer, Berlin Heidelberg"},{"key":"224_CR30","unstructured":"ILOG I (2016) Cplex optimizer 12.7. 0"},{"key":"224_CR31","doi-asserted-by":"crossref","unstructured":"Quadt D, Kuhn H (2007) Capacitated lot-sizing with extensions: A review. 4OR 6(1):61\u201383","DOI":"10.1007\/s10288-007-0057-1"},{"key":"224_CR32","doi-asserted-by":"crossref","DOI":"10.1093\/oso\/9780198538493.001.0001","volume-title":"Neural networks for pattern recognition","author":"CM Bishop","year":"1995","unstructured":"Bishop CM et al (1995) Neural networks for pattern recognition. Oxford University Press"},{"issue":"1","key":"224_CR33","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00291-015-0429-4","volume":"39","author":"K Copil","year":"2017","unstructured":"Copil K, W\u00f6rbelauer M, Meyr H, Tempelmeier H (2017) Simultaneous lot-sizing and scheduling problems: a classification and review of models. OR Spectr 39(1):1\u201364","journal-title":"OR Spectr"},{"issue":"3","key":"224_CR34","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1007\/s10107-003-0465-8","volume":"99","author":"A Atamt\u00fcrk","year":"2004","unstructured":"Atamt\u00fcrk A, Mu\u00f1oz JC (2004) A study of the lot-sizing polytope. Math Program 99(3):443\u2013465","journal-title":"Math Program"},{"issue":"2","key":"224_CR35","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1007\/s10898-015-0349-5","volume":"65","author":"\u0130E B\u00fcy\u00fcktahtak\u0131n","year":"2016","unstructured":"B\u00fcy\u00fcktahtak\u0131n \u0130E, Liu N (2016) Dynamic programming approximation algorithms for the capacitated lot-sizing problem. J Glob Optim 65(2):231\u2013259","journal-title":"J Glob Optim"},{"issue":"2","key":"224_CR36","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/opre.34.2.226","volume":"34","author":"GR Bitran","year":"1986","unstructured":"Bitran GR, Haas EA, Matsuo H (1986) Production planning of style goods with high setup costs and forecast revisions. Oper Res 34(2):226\u2013236","journal-title":"Oper Res"},{"issue":"4","key":"224_CR37","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1287\/opre.1050.0223","volume":"53","author":"A Atamt\u00fcrk","year":"2005","unstructured":"Atamt\u00fcrk A, K\u00fc\u00e7\u00fckyavuz S (2005) Lot sizing with inventory bounds and fixed costs: Polyhedral study and computation. Oper Res 53(4):711\u2013730","journal-title":"Oper Res"},{"key":"224_CR38","doi-asserted-by":"crossref","unstructured":"B\u00fcy\u00fcktahtak\u0131n \u0130E (2023) Scenario-dominance to multi-stage stochastic lot-sizing and knapsack problems. Comput Oper Res 106149","DOI":"10.1016\/j.cor.2023.106149"},{"key":"224_CR39","unstructured":"Yilmaz D, B\u00fcy\u00fcktahtak\u0131n IE (2023) An expandable learning-optimization framework for sequentially dependent decision-making. Under Review"},{"key":"224_CR40","doi-asserted-by":"crossref","unstructured":"Yilmaz D, B\u00fcy\u00fcktahtak\u0131n IE (2023) A non-anticipative learning-optimization framework for solving multi-stage stochastic programs. Under Review","DOI":"10.1007\/s10479-024-06100-7"},{"key":"224_CR41","doi-asserted-by":"crossref","unstructured":"LeCun YA, Bottou L, Orr GB, M\u00fcller KR (2012) Efficient backprop. In Neural networks: Tricks of the trade pages 9\u201348. Springer","DOI":"10.1007\/978-3-642-35289-8_3"},{"key":"224_CR42","unstructured":"Kingma DP, Ba J (2014) Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980"},{"key":"224_CR43","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1016\/j.neucom.2020.07.061","volume":"415","author":"L Yang","year":"2020","unstructured":"Yang L, Shami A (2020) On hyperparameter optimization of machine learning algorithms: Theory and practice. Neurocomputing 415:295\u2013316","journal-title":"Neurocomputing"},{"key":"224_CR44","unstructured":"Bergstra J, Bengio Y (2012) Random search for hyper-parameter optimization. J Mach Learn Res 13(2)"},{"key":"224_CR45","unstructured":"Bischl B, Binder M, Lang M, Pielok T, Richter J, Coors S, Thomas J, Ullmann T, Becker M, Boulesteix AL, et\u00a0al (2021) Hyperparameter optimization: Foundations, algorithms, best practices, and open challenges. Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery page e1484"},{"key":"224_CR46","unstructured":"Yu T, Zhu H (2020) Hyper-parameter optimization: A review of algorithms and applications. arXiv preprint arXiv:2003.05689"},{"issue":"1","key":"224_CR47","first-page":"26","volume":"17","author":"J Wu","year":"2019","unstructured":"Wu J, Chen XY, Zhang H, Xiong LD, Lei H, Deng SH (2019) Hyperparameter optimization for machine learning models based on Bayesian optimization. J Electrochem Sci Technol 17(1):26\u201340","journal-title":"J Electrochem Sci Technol"},{"key":"224_CR48","doi-asserted-by":"crossref","unstructured":"Lorenzo PR, Nalepa J, Kawulok M, Ramos LS, Pastor JR (2017) Particle swarm optimization for hyper-parameter selection in deep neural networks. In Proceedings of the genetic and evolutionary computation conference pages 481\u2013488","DOI":"10.1145\/3071178.3071208"},{"issue":"1","key":"224_CR49","first-page":"1997","volume":"20","author":"T Elsken","year":"2019","unstructured":"Elsken T, Metzen JH, Hutter F (2019) Neural architecture search: A survey. J Mach Learn Res 20(1):1997\u20132017","journal-title":"J Mach Learn Res"},{"key":"224_CR50","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1016\/j.jclepro.2015.02.001","volume":"94","author":"AB Kantas","year":"2015","unstructured":"Kantas AB, Cobuloglu HI, B\u00fcy\u00fcktahtak\u0131n \u0130E (2015) Multi-source capacitated lot-sizing for economically viable and clean biofuel production. J Clean Prod 94:116\u2013129","journal-title":"J Clean Prod"},{"key":"224_CR51","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1016\/j.jclepro.2015.03.055","volume":"100","author":"F Shrouf","year":"2015","unstructured":"Shrouf F, Miragliotta G (2015) Energy management based on internet of things: practices and framework for adoption in production management. J Clean Prod 100:235\u2013246","journal-title":"J Clean Prod"},{"issue":"4","key":"224_CR52","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1080\/07408179208964233","volume":"24","author":"R Uzsoy","year":"1992","unstructured":"Uzsoy R, Lee CY, Martin-Vega LA (1992) A review of production planning and scheduling models in the semiconductor industry part I: System characteristics, performance evaluation and production planning. IIE Trans 24(4):47\u201360","journal-title":"IIE Trans"},{"issue":"1","key":"224_CR53","first-page":"3133","volume":"15","author":"M Fern\u00e1ndez-Delgado","year":"2014","unstructured":"Fern\u00e1ndez-Delgado M, Cernadas E, Barro S, Amorim D (2014) Do we need hundreds of classifiers to solve real world classification problems? J Mach Learn Res 15(1):3133\u20133181","journal-title":"J Mach Learn Res"},{"key":"224_CR54","doi-asserted-by":"crossref","unstructured":"B\u00fcy\u00fcktahtak\u0131n IE (2022) Stage-t scenario dominance for risk-averse multi-stage stochastic mixed-integer programs. Ann Oper Res 309(1):1\u201335. Springer","DOI":"10.1007\/s10479-021-04388-3"},{"key":"224_CR55","unstructured":"Bahdanau D, Cho K, Bengio Y (2014) Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473"},{"key":"224_CR56","unstructured":"Vaswani A, Shazeer N, Parmar N, Uszkoreit J, Jones L, Gomez AN, Kaiser \u0141, Polosukhin I (2017) Attention is all you need. Adv Neural Inf Proces Syst 30"}],"container-title":["Operations Research Forum"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00224-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s43069-023-00224-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s43069-023-00224-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T01:05:14Z","timestamp":1744160714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s43069-023-00224-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,6]]},"references-count":56,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2023,6]]}},"alternative-id":["224"],"URL":"https:\/\/doi.org\/10.1007\/s43069-023-00224-5","relation":{},"ISSN":["2662-2556"],"issn-type":[{"value":"2662-2556","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,6,6]]},"assertion":[{"value":"27 June 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 May 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 June 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Update","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"On pages 13, 15, and 16, \"problem ()\" must be replaced by \"problem (3a-3c)\".","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics Approval"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent to Participate"}},{"value":"Consent for publication will be given upon the acceptance of the paper.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for Publication"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflicts of Interest Statement"}}],"article-number":"48"}}