{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T14:42:19Z","timestamp":1773931339522,"version":"3.50.1"},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:00:00Z","timestamp":1616544000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T00:00:00Z","timestamp":1616544000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"name":"National Science Foundation","award":["CCF-1320137"],"award-info":[{"award-number":["CCF-1320137"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2021,9]]},"DOI":"10.1007\/s10898-021-01009-y","type":"journal-article","created":{"date-parts":[[2021,3,24]],"date-time":"2021-03-24T02:02:15Z","timestamp":1616551335000},"page":"233-260","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":42,"title":["Optimal decision trees for categorical data via integer programming"],"prefix":"10.1007","volume":"81","author":[{"given":"Oktay","family":"G\u00fcnl\u00fck","sequence":"first","affiliation":[]},{"given":"Jayant","family":"Kalagnanam","sequence":"additional","affiliation":[]},{"given":"Minhan","family":"Li","sequence":"additional","affiliation":[]},{"given":"Matt","family":"Menickelly","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3547-1841","authenticated-orcid":false,"given":"Katya","family":"Scheinberg","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,3,24]]},"reference":[{"key":"1009_CR1","unstructured":"Bennett, K.P., Blue, J.: Optimal decision trees. Technical Report 214, Rensselaer Polytechnic Institute Math Report (1996)"},{"key":"1009_CR2","first-page":"2396","volume":"3","author":"KP Bennett","year":"1998","unstructured":"Bennett, K.P., Blue, J.A.: A support vector machine approach to decision trees. Neural Netw. Proc. IEEE World Congr. Comput. Intell. 3, 2396\u20132401 (1998)","journal-title":"Neural Netw. Proc. IEEE World Congr. Comput. Intell."},{"issue":"7","key":"1009_CR3","doi-asserted-by":"publisher","first-page":"1039","DOI":"10.1007\/s10994-017-5633-9","volume":"106","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Dunn, J.: Optimal classification trees. Mach. Learn. 106(7), 1039\u20131082 (2017)","journal-title":"Mach. Learn."},{"issue":"2","key":"1009_CR4","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1287\/opre.1060.0360","volume":"55","author":"D Bertsimas","year":"2017","unstructured":"Bertsimas, D., Shioda, R.: Classification and regression via integer optimization. Oper. Res. 55(2), 252\u2013271 (2017)","journal-title":"Oper. Res."},{"key":"1009_CR5","volume-title":"Classification and Regression Trees","author":"L Breiman","year":"1984","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Chapman and Hall, New York (1984)"},{"issue":"1","key":"1009_CR6","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"L Breiman","year":"2001","unstructured":"Breiman, L.: Random forests. Mach. Learn. 45(1), 5\u201332 (2001)","journal-title":"Mach. Learn."},{"key":"1009_CR7","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/1961189.1961199","volume":"2","author":"CC Chang","year":"2011","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: a library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011)","journal-title":"ACM Trans. Intell. Syst. Technol."},{"key":"1009_CR8","volume-title":"Boolean Decision Rules via Column Generation. Advances in Neural Information Processing Systems","author":"S Dash","year":"2018","unstructured":"Dash, S., G\u00fcnl\u00fck, O., Wei, D.: Boolean Decision Rules via Column Generation. Advances in Neural Information Processing Systems. Montreal, Canada (2018)"},{"key":"1009_CR9","unstructured":"FICO Explainable Machine Learning Challenge https:\/\/community.fico.com\/s\/explainable-machine-learning-challenge"},{"issue":"1","key":"1009_CR10","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0020-0190(76)90095-8","volume":"5","author":"L Hyafil","year":"1976","unstructured":"Hyafil, L., Rivest, R.L.: Constructing optimal binary decision trees is np-complete. Inform. Process. Lett. 5(1), 15\u201317 (1976)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"1009_CR11","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/s10462-011-9272-4","volume":"39","author":"SB Kotsiantis","year":"2013","unstructured":"Kotsiantis, S.B.: Decision trees: a recent overview. Artif. Intell. Rev. 39(4), 261\u2013283 (2013)","journal-title":"Artif. Intell. Rev."},{"key":"1009_CR12","unstructured":"Lichman, M.: UCI machine learning repository (2013)"},{"key":"1009_CR13","unstructured":"Malioutov, D.M., Varshney, K.R.: Exact rule learning via boolean compressed sensing. In: Proceedings of the 30th International Conference on Machine Learning, volume 3, pp. 765\u2013773 (2013)"},{"key":"1009_CR14","unstructured":"Murthy, S., Salzberg, S.: Lookahead and pathology in decision tree induction. In: Proceedings of the 14th International Joint Conference on Artificial Intelligence, volume 2, pp. 1025\u20131031, San Francisco, CA, USA, (1995). Morgan Kaufmann Publishers Inc"},{"key":"1009_CR15","unstructured":"Norouzi, M., Collins, M., Johnson, M.A., Fleet, D.J., Kohli, P.: Efficient non-greedy optimization of decision trees. In: Advances in Neural Information Processing Systems, pp. 1720\u20131728, (2015)"},{"key":"1009_CR16","volume-title":"Quinlan. C4.5: Programs for Machine Learning","author":"J Ross","year":"1993","unstructured":"Ross, J.: Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann Publishers Inc., San Francisco (1993)"},{"key":"1009_CR17","unstructured":"Therneau, T., Atkinson, B., Ripley, B.: rpart: Recursive partitioning and regression trees. Technical Report (2017). R package version 4.1-11"},{"key":"1009_CR18","unstructured":"Wang, T., Rudin, C.: Learning optimized or\u2019s of and\u2019s. Technical report, (2015). arxiv:1511.02210"},{"issue":"70","key":"1009_CR19","first-page":"1","volume":"18","author":"T Wang","year":"2017","unstructured":"Wang, T., Rudin, C., Doshi-Velez, F., Liu, Y., Klampfl, E., MacNeille, P.: A Bayesian framework for learning rule sets for interpretable classification. J. Mach. Learn. Res. 18(70), 1\u201337 (2017)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01009-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10898-021-01009-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-021-01009-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:09:18Z","timestamp":1628748558000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10898-021-01009-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,24]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,9]]}},"alternative-id":["1009"],"URL":"https:\/\/doi.org\/10.1007\/s10898-021-01009-y","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,3,24]]},"assertion":[{"value":"13 August 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 March 2021","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"24 March 2021","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}