{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:56Z","timestamp":1740145196528,"version":"3.37.3"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"8","license":[{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T00:00:00Z","timestamp":1650585600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100008982","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCMI-1933373"],"award-info":[{"award-number":["CCMI-1933373"]}],"id":[{"id":"10.13039\/501100008982","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Optim Lett"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s11590-022-01880-y","type":"journal-article","created":{"date-parts":[[2022,4,22]],"date-time":"2022-04-22T06:03:10Z","timestamp":1650607390000},"page":"2513-2525","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Reinforcement learning of simplex pivot rules: a proof of concept"],"prefix":"10.1007","volume":"16","author":[{"given":"Varun","family":"Suriyanarayana","sequence":"first","affiliation":[]},{"given":"Onur","family":"Tavasl\u0131o\u011flu","sequence":"additional","affiliation":[]},{"given":"Ankit B.","family":"Patel","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0379-741X","authenticated-orcid":false,"given":"Andrew J.","family":"Schaefer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,4,22]]},"reference":[{"issue":"1","key":"1880_CR1","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s10107-003-0440-4","volume":"97","author":"DL Applegate","year":"2003","unstructured":"Applegate, D.L., Bixby, R.E., Chv\u00e1tal, V., Cook, W.J.: Implementing the Dantzig-Fulkerson-Johnson algorithm for large traveling salesman problems. Math. Program. 97(1), 91\u2013153 (2003)","journal-title":"Math. Program."},{"key":"1880_CR2","unstructured":"Bello, I., Pham, H., Le, Q.V., Norouzi, M., Bengio, S.: Neural combinatorial optimization with reinforcement learning. In: 5th International Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Workshop Track Proceedings. https:\/\/openreview.net (2017)"},{"issue":"2","key":"1880_CR3","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)","journal-title":"Eur. J. Oper. Res."},{"key":"1880_CR4","unstructured":"Bertsimas, D., Stellato, B.: Online mixed-integer optimization in milliseconds. arXiv preprint arXiv:1907.02206 (2019)"},{"key":"1880_CR5","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.: Learning a classification of mixed-integer quadratic programming problems. In: van Hoeve, W.-J. (ed.) Integration of Constraint Programming, Artificial Intelligence, and Operations Research, pp. 595\u2013604. Springer International Publishing, Cham (2018)"},{"key":"1880_CR6","volume-title":"Linear Programming and Extensions","author":"GB Dantzig","year":"1965","unstructured":"Dantzig, G.B.: Linear Programming and Extensions. Princeton University Press, Princeton (1965)"},{"key":"1880_CR7","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1007\/BF01581089","volume":"57","author":"D Goldfarb","year":"1992","unstructured":"Goldfarb, D., Forrest, J.J.: Steepest-edge simplex algorithms for linear programming. Math. Program. 57, 341\u2013374 (1992)","journal-title":"Math. Program."},{"key":"1880_CR8","unstructured":"Hansknecht, C., Joormann, I., Stiller, S.: Cuts, primal heuristics, and learning to branch for the time-dependent traveling salesman problem. arXiv preprint arXiv:1805.01415 (2018)"},{"key":"1880_CR9","first-page":"6348","volume-title":"Advances in Neural Information Processing Systems","author":"E Khalil","year":"2017","unstructured":"Khalil, E., Dai, H., Zhang, Y., Dilkina, B., Song, L.: Learning combinatorial optimization algorithms over graphs. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 30, pp. 6348\u20136358. Curran Associates Inc., New York (2017)"},{"key":"1880_CR10","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Bodic, P.L., Song, L., Nemhauser, G., Dilkina, B.: Learning to branch in mixed integer programming. In: Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI\u201916, pp. 724\u2013731. AAAI Press (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"1880_CR11","unstructured":"Klee, V., Minty, G.J.: How good is the simplex algorithm In: Shisha, O. (ed.) Inequalities: III. Acad Press, New York (1972)"},{"key":"1880_CR12","doi-asserted-by":"crossref","unstructured":"Kuhn, H.W., Quandt, R.E.: An experimental study of the simplex method. In: Proceedings of Symposia in Applied Maths, vol. XV, pp. 107\u2013124 (1963)","DOI":"10.1090\/psapm\/015\/0161746"},{"issue":"4","key":"1880_CR13","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1145\/321043.321046","volume":"7","author":"CE Miller","year":"1960","unstructured":"Miller, C.E., Tucker, A.W., Zemlin, R.A.: Integer programming formulations and traveling salesman problems. J. Assoc. Comput. Mach. 7(4), 326\u2013329 (1960)","journal-title":"J. Assoc. Comput. Mach."},{"key":"1880_CR14","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., Graves, A., Antonoglou, I., Wierstra, D., Riedmiller, M.: Playing atari with deep reinforcement learning. In: NIPS Deep Learning Workshop (2013)"},{"key":"1880_CR15","doi-asserted-by":"publisher","first-page":"321","DOI":"10.2298\/YJOR140228016P","volume":"24","author":"N Ploskas","year":"2014","unstructured":"Ploskas, N., Samaras, N.: Pivoting rules for the revised simplex algorithm. Yugosl. J. Oper. Res. 24, 321\u2013332 (2014)","journal-title":"Yugosl. J. Oper. Res."},{"key":"1880_CR16","unstructured":"Thomadakis, M.E.: Implementation and evaluation of primal and dual simplex methods with different pivot-selection techniques in the LPBench environment, a research report. Texas A &M University, Department of Computer Science (1994)"},{"key":"1880_CR17","first-page":"2692","volume-title":"Advances in Neural Information Processing Systems","author":"O Vinyals","year":"2015","unstructured":"Vinyals, O., Fortunato, M., Jaitly, N.: Pointer networks. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol. 28, pp. 2692\u20132700. Curran Associates Inc, New York (2015)"},{"key":"1880_CR18","volume-title":"Recent Advances in Mathematical Programming","author":"P Wolfe","year":"1963","unstructured":"Wolfe, P., Cutler, L.: Experiments in linear programming. In: Graves, R.L., Wolfe, P. (eds.) Recent Advances in Mathematical Programming. McGraw-Hill, New York (1963)"},{"issue":"1","key":"1880_CR19","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1109\/4235.585893","volume":"1","author":"DH Wolpert","year":"1997","unstructured":"Wolpert, D.H., Macready, W.G., et al.: No free lunch theorems for optimization. IEEE Trans. Evolut. Comput. 1(1), 67\u201382 (1997)","journal-title":"IEEE Trans. Evolut. Comput."}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01880-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-022-01880-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-022-01880-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,3]],"date-time":"2023-02-03T00:31:05Z","timestamp":1675384265000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-022-01880-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,22]]},"references-count":19,"journal-issue":{"issue":"8","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["1880"],"URL":"https:\/\/doi.org\/10.1007\/s11590-022-01880-y","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2022,4,22]]},"assertion":[{"value":"16 August 2021","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 March 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"22 April 2022","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}