{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T03:35:31Z","timestamp":1776310531723,"version":"3.50.1"},"publisher-location":"Cham","reference-count":66,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031332708","type":"print"},{"value":"9783031332715","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-33271-5_20","type":"book-chapter","created":{"date-parts":[[2023,5,22]],"date-time":"2023-05-22T17:03:04Z","timestamp":1684774984000},"page":"299-319","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":9,"title":["Ner4Opt: Named Entity Recognition for\u00a0Optimization Modelling from\u00a0Natural Language"],"prefix":"10.1007","author":[{"given":"Parag Pravin","family":"Dakle","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4672-6830","authenticated-orcid":false,"given":"Serdar","family":"Kad\u0131o\u011flu","sequence":"additional","affiliation":[]},{"given":"Karthik","family":"Uppuluri","sequence":"additional","affiliation":[]},{"given":"Regina","family":"Politi","sequence":"additional","affiliation":[]},{"given":"Preethi","family":"Raghavan","sequence":"additional","affiliation":[]},{"given":"SaiKrishna","family":"Rallabandi","sequence":"additional","affiliation":[]},{"given":"Ravisutha","family":"Srinivasamurthy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,5,23]]},"reference":[{"key":"20_CR1","unstructured":"Araci, D.: Finbert: financial sentiment analysis with pre-trained language models. arXiv preprint arXiv:1908.10063 (2019)"},{"key":"20_CR2","unstructured":"Balcan, M., Prasad, S., Sandholm, T., Vitercik, E.: Sample complexity of tree search configuration: cutting planes and beyond. In: Ranzato, M., Beygelzimer, A., Dauphin, Y.N., Liang, P., Vaughan, J.W. (eds.) Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, NeurIPS 2021, 6\u201314 December 2021, pp. 4015\u20134027 (2021). https:\/\/proceedings.neurips.cc\/paper\/2021\/hash\/210b7ec74fc9cec6fb8388dbbdaf23f7-Abstract.html"},{"key":"20_CR3","doi-asserted-by":"publisher","unstructured":"Balcan, M., Prasad, S., Sandholm, T., Vitercik, E.: Improved sample complexity bounds for branch-and-cut. In: Solnon, C. (ed.) 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, 31 July to 8 August 2022, Haifa, Israel. LIPIcs, vol.\u00a0235, pp. 3:1\u20133:19. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2022.3","DOI":"10.4230\/LIPIcs.CP.2022.3"},{"key":"20_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-642-33558-7_13","volume-title":"Principles and Practice of Constraint Programming","author":"N Beldiceanu","year":"2012","unstructured":"Beldiceanu, N., Simonis, H.: A model seeker: extracting global constraint models from positive examples. In: Milano, M. (ed.) CP 2012. LNCS, pp. 141\u2013157. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33558-7_13"},{"key":"20_CR5","doi-asserted-by":"publisher","unstructured":"Beltagy, I., Lo, K., Cohan, A.: SciBERT: a pretrained language model for scientific text. In: Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), Hong Kong, China, pp. 3615\u20133620. Association for Computational Linguistics (2019). https:\/\/doi.org\/10.18653\/v1\/D19-1371. https:\/\/aclanthology.org\/D19-1371","DOI":"10.18653\/v1\/D19-1371"},{"key":"20_CR6","doi-asserted-by":"publisher","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. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221720306895","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"20_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/978-3-540-30201-8_12","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2004","author":"C Bessiere","year":"2004","unstructured":"Bessiere, C., Coletta, R., Freuder, E.C., O\u2019Sullivan, B.: Leveraging the learning power of examples in automated constraint acquisition. In: Wallace, M. (ed.) CP 2004. LNCS, vol. 3258, pp. 123\u2013137. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30201-8_12"},{"key":"20_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Boyd, S.P., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"key":"20_CR9","first-page":"1877","volume":"33","author":"T Brown","year":"2020","unstructured":"Brown, T., et al.: Language models are few-shot learners. Adv. Neural. Inf. Process. Syst. 33, 1877\u20131901 (2020)","journal-title":"Adv. Neural. Inf. Process. Syst."},{"key":"20_CR10","unstructured":"Chinchor, N., Robinson, P.: Appendix E: MUC-7 named entity task definition (version 3.5). In: Seventh Message Understanding Conference (MUC-7): Proceedings of a Conference Held in Fairfax, Virginia, 29 April\u20131 May 1998 (1998). https:\/\/aclanthology.org\/M98-1028"},{"key":"20_CR11","doi-asserted-by":"crossref","unstructured":"Conneau, A., et al.: Unsupervised cross-lingual representation learning at scale. arXiv preprint arXiv:1911.02116 (2019)","DOI":"10.18653\/v1\/2020.acl-main.747"},{"key":"20_CR12","unstructured":"Devlin, J., Chang, M.W., Lee, K., Toutanova, K.: Bert: pre-training of deep bidirectional transformers for language understanding. arXiv preprint arXiv:1810.04805 (2018)"},{"key":"20_CR13","unstructured":"Fisch, A., Jia, R., Schuster, T.: Uncertainty estimation for natural language processing. In: COLING (2022). https:\/\/sites.google.com\/view\/uncertainty-nlp"},{"issue":"1","key":"20_CR14","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/TVCG.2016.2598545","volume":"23","author":"S Goodwin","year":"2017","unstructured":"Goodwin, S., Mears, C., Dwyer, T., de la Banda, M.G., Tack, G., Wallace, M.: What do constraint programming users want to see? Exploring the role of visualisation in profiling of models and search. IEEE Trans. Vis. Comput. Graph. 23(1), 281\u2013290 (2017). https:\/\/doi.org\/10.1109\/TVCG.2016.2598545","journal-title":"IEEE Trans. Vis. Comput. Graph."},{"key":"20_CR15","doi-asserted-by":"crossref","unstructured":"Grishman, R., Sundheim, B.: Message understanding conference- 6: a brief history. In: COLING 1996 Volume 1: The 16th International Conference on Computational Linguistics (1996). https:\/\/aclanthology.org\/C96-1079","DOI":"10.3115\/992628.992709"},{"key":"20_CR16","unstructured":"Guns, T.: On learning and branching: a survey. In: The 18th Workshop on Constraint Modelling and Reformulation (2019)"},{"key":"20_CR17","unstructured":"He, H., Daume\u00a0III, H., Eisner, J.M.: Learning to search in branch and bound algorithms. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K. (eds.) Advances in Neural Information Processing Systems, vol. 27. Curran Associates, Inc. (2014). https:\/\/proceedings.neurips.cc\/paper\/2014\/file\/757f843a169cc678064d9530d12a1881-Paper.pdf"},{"key":"20_CR18","unstructured":"Hildebrand, R., Poirrier, L., Bish, D., Moran, D.: Mathematical programming and operations research (2022). https:\/\/github.com\/open-optimization\/open-optimization-or-book"},{"key":"20_CR19","unstructured":"Honnibal, M., Montani, I., Van Landeghem, S., Boyd, A.: Spacy: industrial-strength natural language processing in python (2020)"},{"key":"20_CR20","doi-asserted-by":"crossref","unstructured":"Howard, J., Ruder, S.: Universal language model fine-tuning for text classification. arXiv preprint arXiv:1801.06146 (2018)","DOI":"10.18653\/v1\/P18-1031"},{"issue":"1","key":"20_CR21","first-page":"267","volume":"36","author":"F Hutter","year":"2009","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K., St\u00fctzle, T.: Paramils: an automatic algorithm configuration framework. J. Artif. Int. Res. 36(1), 267\u2013306 (2009)","journal-title":"J. Artif. Int. Res."},{"key":"20_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"454","DOI":"10.1007\/978-3-642-23786-7_35","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2011","author":"S Kadioglu","year":"2011","unstructured":"Kadioglu, S., Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Algorithm selection and scheduling. In: Lee, J. (ed.) CP 2011. LNCS, vol. 6876, pp. 454\u2013469. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-23786-7_35"},{"key":"20_CR23","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M.: Non-model-based search guidance for set partitioning problems. In: Hoffmann, J., Selman, B. (eds.) Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 22\u201326 July 2012, Toronto, Ontario, Canada. AAAI Press (2012). http:\/\/www.aaai.org\/ocs\/index.php\/AAAI\/AAAI12\/paper\/view\/5082"},{"key":"20_CR24","doi-asserted-by":"publisher","unstructured":"Kadioglu, S., Malitsky, Y., Sellmann, M., Tierney, K.: ISAC - instance-specific algorithm configuration. In: Coelho, H., Studer, R., Wooldridge, M.J. (eds.) ECAI 2010 - 19th European Conference on Artificial Intelligence, Lisbon, Portugal, 16\u201320 August 2010, Proceedings. Frontiers in Artificial Intelligence and Applications, vol.\u00a0215, pp. 751\u2013756. IOS Press (2010). https:\/\/doi.org\/10.3233\/978-1-60750-606-5-751","DOI":"10.3233\/978-1-60750-606-5-751"},{"issue":"9\u201310","key":"20_CR25","doi-asserted-by":"publisher","first-page":"1441","DOI":"10.1007\/s10994-017-5640-x","volume":"106","author":"S Kolb","year":"2017","unstructured":"Kolb, S., Paramonov, S., Guns, T., Raedt, L.D.: Learning constraints in spreadsheets and tabular data. Mach. Learn. 106(9\u201310), 1441\u20131468 (2017). https:\/\/doi.org\/10.1007\/s10994-017-5640-x","journal-title":"Mach. Learn."},{"key":"20_CR26","doi-asserted-by":"publisher","unstructured":"Kumar, M., Kolb, S., Guns, T.: Learning constraint programming models from data using generate-and-aggregate. In: Solnon, C. (ed.) 28th International Conference on Principles and Practice of Constraint Programming, CP 2022, 31 July to 8 August 2022, Haifa, Israel. LIPIcs, vol.\u00a0235, pp. 29:1\u201329:16. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022). https:\/\/doi.org\/10.4230\/LIPIcs.CP.2022.29","DOI":"10.4230\/LIPIcs.CP.2022.29"},{"issue":"2","key":"20_CR27","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/s10601-018-9281-x","volume":"23","author":"P Laborie","year":"2018","unstructured":"Laborie, P., Rogerie, J., Shaw, P., Vil\u00edm, P.: IBM ILOG CP optimizer for scheduling - 20+ years of scheduling with constraints at IBM\/ILOG. Constraints 23(2), 210\u2013250 (2018). https:\/\/doi.org\/10.1007\/s10601-018-9281-x","journal-title":"Constraints"},{"key":"20_CR28","unstructured":"Lafferty, J.D., McCallum, A., Pereira, F.C.N.: Conditional random fields: probabilistic models for segmenting and labeling sequence data. In: Brodley, C.E., Danyluk, A.P. (eds.) Proceedings of the Eighteenth International Conference on Machine Learning (ICML 2001), Williams College, Williamstown, MA, USA, 28 June\u20131 July 2001, pp. 282\u2013289. Morgan Kaufmann (2001)"},{"key":"20_CR29","doi-asserted-by":"crossref","unstructured":"Lai, G., Xie, Q., Liu, H., Yang, Y., Hovy, E.: Race: large-scale reading comprehension dataset from examinations. arXiv preprint arXiv:1704.04683 (2017)","DOI":"10.18653\/v1\/D17-1082"},{"key":"20_CR30","doi-asserted-by":"publisher","unstructured":"Lee, J., Yoon, W., Kim, S., Kim, D., Kim, S., So, C.H., Kang, J.: BioBERT: a pre-trained biomedical language representation model for biomedical text mining. Bioinformatics (2019). https:\/\/doi.org\/10.1093\/bioinformatics\/btz682","DOI":"10.1093\/bioinformatics\/btz682"},{"issue":"3","key":"20_CR31","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.ejor.2015.08.018","volume":"248","author":"GMD Liberto","year":"2016","unstructured":"Liberto, G.M.D., Kadioglu, S., Leo, K., Malitsky, Y.: DASH: dynamic approach for switching heuristics. Eur. J. Oper. Res. 248(3), 943\u2013953 (2016). https:\/\/doi.org\/10.1016\/j.ejor.2015.08.018","journal-title":"Eur. J. Oper. Res."},{"key":"20_CR32","unstructured":"Liu, Y., et al.: Roberta: a robustly optimized bert pretraining approach. arXiv preprint arXiv:1907.11692 (2019)"},{"issue":"2","key":"20_CR33","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.: On learning and branching: a survey. TOP 25(2), 207\u2013236 (2017). https:\/\/doi.org\/10.1007\/s11750-017-0451-6","journal-title":"TOP"},{"key":"20_CR34","doi-asserted-by":"crossref","unstructured":"Morwal, S., Jahan, N., Chopra, D.: Named entity recognition using hidden Markov model (HMM). Int. J. Nat. Lang. Comput. (IJNLC) 1 (2012)","DOI":"10.5121\/ijnlc.2012.1402"},{"issue":"7","key":"20_CR35","doi-asserted-by":"publisher","first-page":"1171","DOI":"10.1016\/j.future.2004.04.005","volume":"21","author":"HAD do Nascimento","year":"2005","unstructured":"do Nascimento, H.A.D., Eades, P.: User hints: a framework for interactive optimization. Future Gener. Comput. Syst. 21(7), 1171\u20131191 (2005). https:\/\/doi.org\/10.1016\/j.future.2004.04.005","journal-title":"Future Gener. Comput. Syst."},{"key":"20_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1007\/978-3-540-74970-7_38","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2007","author":"N Nethercote","year":"2007","unstructured":"Nethercote, N., Stuckey, P.J., Becket, R., Brand, S., Duck, G.J., Tack, G.: MiniZinc: towards a standard CP modelling language. In: Bessi\u00e8re, C. (ed.) CP 2007. LNCS, vol. 4741, pp. 529\u2013543. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-74970-7_38"},{"key":"20_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/11564751_34","volume-title":"Principles and Practice of Constraint Programming - CP 2005","author":"B O\u2019Callaghan","year":"2005","unstructured":"O\u2019Callaghan, B., O\u2019Sullivan, B., Freuder, E.C.: Generating corrective explanations for interactive constraint satisfaction. In: van Beek, P. (ed.) CP 2005. LNCS, vol. 3709, pp. 445\u2013459. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11564751_34"},{"key":"20_CR38","doi-asserted-by":"publisher","unstructured":"Paramonov, S., Kolb, S., Guns, T., Raedt, L.D.: Tacle: learning constraints in tabular data. In: Lim, E., et al. (eds.) Proceedings of the 2017 ACM on Conference on Information and Knowledge Management, CIKM 2017, Singapore, 06\u201310 November 2017, pp. 2511\u20132514. ACM (2017). https:\/\/doi.org\/10.1145\/3132847.3133193","DOI":"10.1145\/3132847.3133193"},{"key":"20_CR39","unstructured":"Pascanu, R., Mikolov, T., Bengio, Y.: On the difficulty of training recurrent neural networks. In: International Conference on Machine Learning, pp. 1310\u20131318. PMLR (2013)"},{"key":"20_CR40","doi-asserted-by":"publisher","unstructured":"Pawlak, T.P., Krawiec, K.: Automatic synthesis of constraints from examples using mixed integer linear programming. Eur. J. Oper. Res. 261(3), 1141\u20131157 (2017). https:\/\/doi.org\/10.1016\/j.ejor.2017.02.034. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S037722171730156X","DOI":"10.1016\/j.ejor.2017.02.034"},{"key":"20_CR41","unstructured":"Quattoni, A., Collins, M., Darrell, T.: Conditional random fields for object recognition. In: Advances in Neural Information Processing Systems, vol. 17 (2004)"},{"key":"20_CR42","unstructured":"Radford, A., Narasimhan, K., Salimans, T., Sutskever, I., et al.: Improving language understanding by generative pre-training (2018)"},{"key":"20_CR43","unstructured":"Radford, A., Wu, J., Child, R., Luan, D., Amodei, D., Sutskever, I.: Language models are unsupervised multitask learners (2019)"},{"key":"20_CR44","unstructured":"Raedt, L.D., Passerini, A., Teso, S.: Learning constraints from examples. In: AAAI Conference on Artificial Intelligence (2018)"},{"key":"20_CR45","unstructured":"Rajapakse, T.C.: Simple transformers (2019). https:\/\/github.com\/ThilinaRajapakse\/simpletransformers"},{"key":"20_CR46","doi-asserted-by":"crossref","unstructured":"Rajpurkar, P., Jia, R., Liang, P.: Know what you don\u2019t know: unanswerable questions for squad. arXiv preprint arXiv:1806.03822 (2018)","DOI":"10.18653\/v1\/P18-2124"},{"key":"20_CR47","doi-asserted-by":"crossref","unstructured":"Rajpurkar, P., Zhang, J., Lopyrev, K., Liang, P.: Squad: 100,000+ questions for machine comprehension of text. arXiv preprint arXiv:1606.05250 (2016)","DOI":"10.18653\/v1\/D16-1264"},{"key":"20_CR48","doi-asserted-by":"publisher","unstructured":"Ramamonjison, R., Li, H., et al.: Augmenting operations research with auto-formulation of optimization models from problem descriptions (2022). https:\/\/doi.org\/10.48550\/ARXIV.2209.15565. https:\/\/arxiv.org\/abs\/2209.15565","DOI":"10.48550\/ARXIV.2209.15565"},{"key":"20_CR49","doi-asserted-by":"crossref","unstructured":"Ratinov, L., Roth, D.: Design challenges and misconceptions in named entity recognition. In: Proceedings of the Thirteenth Conference on Computational Natural Language Learning (CoNLL-2009), pp. 147\u2013155 (2009)","DOI":"10.3115\/1596374.1596399"},{"key":"20_CR50","doi-asserted-by":"crossref","unstructured":"Rau, L.F.: Extracting company names from text. In: Proceedings the Seventh IEEE Conference on Artificial Intelligence Application, pp. 29\u201330. IEEE Computer Society (1991)","DOI":"10.1109\/CAIA.1991.120841"},{"key":"20_CR51","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1007\/978-3-642-29828-8_23","volume-title":"Integration of AI and OR Techniques in Contraint Programming for Combinatorial Optimzation Problems","author":"A Sabharwal","year":"2012","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: Beldiceanu, N., Jussien, N., Pinson, \u00c9. (eds.) CPAIOR 2012. LNCS, vol. 7298, pp. 356\u2013361. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-29828-8_23"},{"key":"20_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"460","DOI":"10.1007\/978-3-642-15396-9_37","volume-title":"Principles and Practice of Constraint Programming \u2013 CP 2010","author":"H Simonis","year":"2010","unstructured":"Simonis, H., Davern, P., Feldman, J., Mehta, D., Quesada, L., Carlsson, M.: A generic visualization platform for CP. In: Cohen, D. (ed.) CP 2010. LNCS, vol. 6308, pp. 460\u2013474. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-15396-9_37"},{"key":"20_CR53","unstructured":"Tang, Y., Agrawal, S., Faenza, Y.: Reinforcement learning for integer programming: learning to cut. In: Daume III, H., Singh, A. (eds.) Proceedings of the 37th International Conference on Machine Learning. Proceedings of Machine Learning Research, vol.\u00a0119, pp. 9367\u20139376. PMLR (2020). https:\/\/proceedings.mlr.press\/v119\/tang20a.html"},{"key":"20_CR54","volume-title":"An Introduction to Linear Programming and Game Theory","author":"PR Thie","year":"2011","unstructured":"Thie, P.R., Keough, G.E.: An Introduction to Linear Programming and Game Theory. Wiley, Hoboken (2011)"},{"key":"20_CR55","doi-asserted-by":"crossref","unstructured":"Tjong Kim\u00a0Sang, E.F.: Introduction to the CoNLL-2002 shared task: language-independent named entity recognition. In: COLING-02: The 6th Conference on Natural Language Learning 2002 (CoNLL-2002) (2002). https:\/\/aclanthology.org\/W02-2024","DOI":"10.3115\/1118853.1118877"},{"key":"20_CR56","volume-title":"The OPL Optimization Programming Language","author":"P Van Hentenryck","year":"1999","unstructured":"Van Hentenryck, P.: The OPL Optimization Programming Language. MIT Press, Cambridge (1999)"},{"key":"20_CR57","unstructured":"Vaswani, A., et al.: Attention is all you need. In: Advances in Neural Information Processing Systems, vol. 30 (2017)"},{"key":"20_CR58","doi-asserted-by":"crossref","unstructured":"Wang, A., Singh, A., Michael, J., Hill, F., Levy, O., Bowman, S.R.: Glue: a multi-task benchmark and analysis platform for natural language understanding. arXiv preprint arXiv:1804.07461 (2018)","DOI":"10.18653\/v1\/W18-5446"},{"key":"20_CR59","unstructured":"Wolf, T., et al.: Huggingface\u2019s transformers: state-of-the-art natural language processing. arXiv preprint arXiv:1910.03771 (2019)"},{"key":"20_CR60","unstructured":"Yadav, V., Bethard, S.: A survey on recent advances in named entity recognition from deep learning models. arXiv preprint arXiv:1910.11470 (2019)"},{"key":"20_CR61","doi-asserted-by":"publisher","unstructured":"Yang, Y., Boland, N., Dilkina, B., Savelsbergh, M.: Learning generalized strong branching for set covering, set packing, and 0-1 knapsack problems. Eur. J. Oper. Res. 301(3), 828\u2013840 (2022). https:\/\/doi.org\/10.1016\/j.ejor.2021.11.050. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0377221721010018","DOI":"10.1016\/j.ejor.2021.11.050"},{"key":"20_CR62","unstructured":"Yang, Z., Dai, Z., Yang, Y., Carbonell, J., Salakhutdinov, R.R., Le, Q.V.: Xlnet: generalized autoregressive pretraining for language understanding. In: Advances in Neural Information Processing Systems, vol. 32 (2019)"},{"key":"20_CR63","doi-asserted-by":"crossref","unstructured":"Zhao, S.: Named entity recognition in biomedical texts using an hmm model. In: Proceedings of the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (NLPBA\/BioNLP), pp. 87\u201390 (2004)","DOI":"10.3115\/1567594.1567613"},{"key":"20_CR64","unstructured":"Zhong, V., Xiong, C., Socher, R.: Seq2sql: generating structured queries from natural language using reinforcement learning. arXiv preprint arXiv:1709.00103 (2017)"},{"key":"20_CR65","doi-asserted-by":"crossref","unstructured":"Zhou, G., Su, J.: Named entity recognition using an HMM-based chunk tagger. In: Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics, pp. 473\u2013480 (2002)","DOI":"10.3115\/1073083.1073163"},{"issue":"4","key":"20_CR66","doi-asserted-by":"publisher","first-page":"550","DOI":"10.1145\/279232.279236","volume":"23","author":"C Zhu","year":"1997","unstructured":"Zhu, C., Byrd, R.H., Lu, P., Nocedal, J.: Algorithm 778: L-BFGS-B: fortran subroutines for large-scale bound-constrained optimization. ACM Trans. Math. Softw. (TOMS) 23(4), 550\u2013560 (1997)","journal-title":"ACM Trans. Math. Softw. (TOMS)"}],"container-title":["Lecture Notes in Computer Science","Integration of Constraint Programming, Artificial Intelligence, and Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-33271-5_20","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T21:40:38Z","timestamp":1729460438000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-33271-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031332708","9783031332715"],"references-count":66,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-33271-5_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"23 May 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CPAIOR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Integration of Constraint Programming, Artificial Intelligence, and Operations Research","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nice","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","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":"29 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cpaior2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sites.google.com\/view\/cpaior2023","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"71","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}