{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:08:28Z","timestamp":1767650908852},"reference-count":39,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2014,6,28]],"date-time":"2014-06-28T00:00:00Z","timestamp":1403913600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10994-014-5459-7","type":"journal-article","created":{"date-parts":[[2014,6,27]],"date-time":"2014-06-27T10:52:34Z","timestamp":1403866354000},"page":"33-64","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["On combining machine learning with decision making"],"prefix":"10.1007","volume":"97","author":[{"given":"Theja","family":"Tulabandhula","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Cynthia","family":"Rudin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,6,28]]},"reference":[{"key":"5459_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, S. (2006). Ranking on graph data. In Proceedings of the 23rd International Conference on Machine Learning.","DOI":"10.1145\/1143844.1143848"},{"key":"5459_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624216","volume-title":"Neural network learning: Theoretical foundations","author":"M Anthony","year":"1999","unstructured":"Anthony, M., & Bartlett, P. L. (1999). Neural network learning: Theoretical foundations. Cambridge, MA: Cambridge University Press."},{"key":"5459_CR3","doi-asserted-by":"crossref","unstructured":"Archer, A., & Blasiak, A. (2010). Improved approximation algorithms for the minimum latency problem via prize-collecting strolls. In Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 429\u2013447).","DOI":"10.1137\/1.9781611973075.36"},{"issue":"5","key":"5459_CR4","doi-asserted-by":"crossref","first-page":"1472","DOI":"10.1137\/07068151X","volume":"37","author":"A Archer","year":"2008","unstructured":"Archer, A., Levin, A., & Williamson, D. P. (2008). A faster, better approximation algorithm for the minimum latency problem. SIAM Journal of Computing, 37(5), 1472\u20131498.","journal-title":"SIAM Journal of Computing"},{"issue":"3","key":"5459_CR5","doi-asserted-by":"crossref","first-page":"491","DOI":"10.1007\/s10107-005-0693-1","volume":"107","author":"S Arora","year":"2006","unstructured":"Arora, S., & Karakostas, G. (2006). A 2 + $$\\epsilon $$ \u03f5 approximation algorithm for the $$k$$ k -MST problem. Mathematical Programming, 107(3), 491\u2013504.","journal-title":"Mathematical Programming"},{"issue":"8","key":"5459_CR6","doi-asserted-by":"crossref","first-page":"1037","DOI":"10.1057\/jors.1996.130","volume":"47","author":"F Barbera","year":"1996","unstructured":"Barbera, F., Schneider, H., & Kelle, P. (1996). A condition based maintenance model with exponential failures and fixed inspection intervals. The Journal of the Operational Research Society, 47(8), 1037\u20131045.","journal-title":"The Journal of the Operational Research Society"},{"key":"5459_CR7","first-page":"2399","volume":"7","author":"M Belkin","year":"2006","unstructured":"Belkin, M., Niyogi, P., & Sindhwani, V. (2006). Manifold regularization: A geometric framework for learning from labeled and unlabeled examples. Journal of Machine Learning Research, 7, 2399\u20132434.","journal-title":"Journal of Machine Learning Research"},{"key":"5459_CR8","doi-asserted-by":"crossref","unstructured":"Blum, A., Chalasani, P., Coppersmith, D., Pulleyblank, B., Raghavan, P., & Sudan, M. (1994). On the minimum latency problem. ArXiv Mathematics e-prints.","DOI":"10.1145\/195058.195125"},{"issue":"2","key":"5459_CR9","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1016\/j.disopt.2006.10.011","volume":"5","author":"P Bonami","year":"2008","unstructured":"Bonami, P., Biegler, L. T., Conn, A. R., Cornu\u00e9jols, G., Grossmann, I. E., Laird, C. D., et al. (2008). An algorithmic framework for convex mixed integer nonlinear programs. Discrete Optimization, 5(2), 186\u2013204.","journal-title":"Discrete Optimization"},{"key":"5459_CR10","volume-title":"Semi-supervised learning","year":"2006","unstructured":"Chapelle, O., Sch\u00f6lkopf, B., & Zien, A. (Eds.). (2006). Semi-supervised learning. Cambridge, MA: MIT Press."},{"issue":"Suppl.","key":"5459_CR11","first-page":"205","volume":"1","author":"I Csisz\u00e1r","year":"1984","unstructured":"Csisz\u00e1r, I., & Tusn\u00e1dy, G. (1984). Information geometry and alternating minimization procedures. Statistics and Decisions, 1(Suppl.), 205\u2013237.","journal-title":"Statistics and Decisions"},{"issue":"1","key":"5459_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-01-00923-5","volume":"39","author":"F Cucker","year":"2002","unstructured":"Cucker, F., & Smale, S. (2002). On the mathematical foundations of learning. Bulletin-American Mathematical Society, 39(1), 1\u201350.","journal-title":"Bulletin-American Mathematical Society"},{"key":"5459_CR13","unstructured":"Ertekin, \u015e., Rudin, C., & McCormick, T. (2013). Predicting power failures with reactive point processes. In Proceedings of AAAI Late Breaking Track."},{"key":"5459_CR14","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1287\/opre.41.6.1055","volume":"41","author":"M Fischetti","year":"1993","unstructured":"Fischetti, M., Laporte, G., & Martello, S. (1993). The delivery man problem and cumulative matroids. Operations Research, 41, 1055\u20131064.","journal-title":"Operations Research"},{"key":"5459_CR15","first-page":"111","volume":"82","author":"M Goemans","year":"1998","unstructured":"Goemans, M., & Kleinberg, J. (1998). An improved approximation ratio for the minimum latency problem. Mathematical Programming, 82, 111\u2013124.","journal-title":"Mathematical Programming"},{"issue":"5","key":"5459_CR16","doi-asserted-by":"crossref","first-page":"1600","DOI":"10.1016\/j.ymssp.2008.12.006","volume":"23","author":"A Heng","year":"2009","unstructured":"Heng, A., Tan, A. C. C., Mathew, J., Montgomery, N., Banjevic, D., & Jardine, A. K. S. (2009). Intelligent condition-based prediction of machinery reliability. Mechanical Systems and Signal Processing, 23(5), 1600\u20131614.","journal-title":"Mechanical Systems and Signal Processing"},{"key":"5459_CR17","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1023\/A:1008382309369","volume":"14","author":"W Huyer","year":"1999","unstructured":"Huyer, W., & Neumaier, A. (1999). Global optimization by multilevel coordinate search. Journal of Global Optimization, 14, 331\u2013355.","journal-title":"Journal of Global Optimization"},{"issue":"2","key":"5459_CR18","first-page":"3","volume":"14","author":"A Kolmogorov","year":"1959","unstructured":"Kolmogorov, A., & Tikhomirov, V. (1959). $$\\varepsilon $$ \u03b5 -Entropy and $$\\varepsilon $$ \u03b5 -capacity of sets in function spaces. Uspekhi Matematicheskikh Nauk, 14(2), 3\u201386.","journal-title":"Uspekhi Matematicheskikh Nauk"},{"key":"5459_CR19","first-page":"1","volume-title":"The traveling repairman problem\u2014An overview","author":"M Lechmann","year":"2009","unstructured":"Lechmann, M. (2009). The traveling repairman problem\u2014An overview (pp. 1\u201379). Diplomarbeit: Universitat Wein."},{"issue":"1","key":"5459_CR20","doi-asserted-by":"crossref","first-page":"66","DOI":"10.3923\/ajms.2011.66.70","volume":"4","author":"S Li","year":"2011","unstructured":"Li, S. (2011). Concise Formulas for the Area and Volume of a Hyperspherical Cap. Asian Journal of Mathematics & Statistics, 4(1), 66\u201370.","journal-title":"Asian Journal of Mathematics & Statistics"},{"key":"5459_CR21","doi-asserted-by":"crossref","first-page":"903","DOI":"10.1090\/S0002-9904-1966-11586-0","volume":"72","author":"GG Lorentz","year":"1966","unstructured":"Lorentz, G. G. (1966). Metric entropy and approximation. Bulletin-American Mathematical Society, 72, 903\u2013937.","journal-title":"Bulletin-American Mathematical Society"},{"issue":"2","key":"5459_CR22","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0951-8320(02)00043-1","volume":"77","author":"M Marseguerra","year":"2002","unstructured":"Marseguerra, M., Zio, E., & Podofillini, L. (2002). Condition-based maintenance optimization by means of genetic algorithms and Monte Carlo simulation. Reliability Engineering & System Safety, 77(2), 151\u2013165.","journal-title":"Reliability Engineering & System Safety"},{"issue":"17","key":"5459_CR23","doi-asserted-by":"crossref","first-page":"3223","DOI":"10.1016\/j.dam.2008.05.009","volume":"156","author":"I M\u00e9ndez-D\u00edaz","year":"2008","unstructured":"M\u00e9ndez-D\u00edaz, I., Zabala, P., & Lucena, A. (2008). A new formulation for the traveling deliveryman problem. Discrete Applied Mathematics, 156(17), 3223\u20133237.","journal-title":"Discrete Applied Mathematics"},{"issue":"4","key":"5459_CR24","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1093\/comjnl\/7.4.308","volume":"7","author":"JA Nelder","year":"1965","unstructured":"Nelder, J. A., & Mead, R. (1965). A simplex method for function minimization. Computer Journal, 7(4), 308\u2013313.","journal-title":"Computer Journal"},{"key":"5459_CR25","unstructured":"Office of Electric Transmission United States Department of Energy and Distribution. (2003). Grid 2030: A national vision for electricity\u2019s second 100 years. Technical report, United States."},{"key":"5459_CR26","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511662454","volume-title":"The volume of convex bodies and Banach space geometry","author":"G Pisier","year":"1989","unstructured":"Pisier, G. (1989). The volume of convex bodies and Banach space geometry (Vol. 94). Cambridge, MA: Cambridge University Press."},{"key":"5459_CR27","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-5254-2","volume-title":"Convergence of stochastic processes","author":"D Pollard","year":"1984","unstructured":"Pollard, D. (1984). Convergence of stochastic processes. Berlin: Springer."},{"key":"5459_CR28","unstructured":"Rios, L. M. (2009). Algorithms for derivative-free optimization. PhD thesis, University of Illinois at Urbana-Champaign, pp. 1\u2013133."},{"issue":"2","key":"5459_CR29","doi-asserted-by":"crossref","first-page":"328","DOI":"10.1109\/TPAMI.2011.108","volume":"34","author":"C Rudin","year":"2012","unstructured":"Rudin, C., Anderson, R. N., Boulanger, A., Salleb-Aouissi, A., Chow, M., Dutta, H., et al. (2012). Machine learning for the New York City power grid. IEEE Transactions on Pattern Analysis and Machine Intelligence, 34(2), 328\u2013345.","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"5459_CR30","doi-asserted-by":"crossref","unstructured":"Rudin, C., Ertekin, \u015e., Passonneau, R., Radeva, A., Tomar, A., Xie, B., et\u00a0al. (2014). Analytics for power grid distribution reliability in New York City. Interfaces. doi: 10.1287\/inte.2014.0748 .","DOI":"10.1287\/inte.2014.0748"},{"key":"5459_CR31","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10994-009-5166-y","volume":"80","author":"C Rudin","year":"2010","unstructured":"Rudin, C., Passonneau, R., Radeva, A., Dutta, H., Ierome, S., & Isaac, D. (2010). A process for predicting manhole events in Manhattan. Machine Learning, 80, 1\u201331.","journal-title":"Machine Learning"},{"issue":"6","key":"5459_CR32","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1109\/MC.2011.164","volume":"44","author":"C Rudin","year":"2011","unstructured":"Rudin, C., Passonneau, R., Radeva, A., Lerome, S., & Isaac, D. (2011). 21st-century data miners meet 19th-century electrical cables. IEEE Computer, 44(6), 103\u2013105.","journal-title":"IEEE Computer"},{"key":"5459_CR33","first-page":"1989","volume":"14","author":"T Tulabandhula","year":"2013","unstructured":"Tulabandhula, T., & Rudin, C. (2013). Machine learning with operational costs. Journal of Machine Learning Research, 14, 1989\u20132028.","journal-title":"Journal of Machine Learning Research"},{"key":"5459_CR34","doi-asserted-by":"crossref","unstructured":"Tulabandhula, T., Rudin, C., & Jaillet, P. (2011). The machine learning and traveling repairman problem. In Proceedings of the Second International Conference on Algorithmic Decision Theory.","DOI":"10.1007\/978-3-642-24873-3_20"},{"key":"5459_CR35","unstructured":"Urbina, I. (2004). Mandatory safety rules are proposed for electric utilities. New York Times, Aug 21, Late Edition, Sec B, Col 3, Metropolitan Desk, p. 2."},{"key":"5459_CR36","unstructured":"van Eijl, C. A. (1995). A polyhedral approach to the delivery man problem. Technical report, Memorandum COSOR 95\u201319, Department of Mathematics and Computer Science, Eindhoven University of Technology, The Netherlands."},{"key":"5459_CR37","doi-asserted-by":"crossref","unstructured":"Weintraub, A., Aboud, J., Fernandez, C., Laporte, G., & Ramirez, E. (1999). An emergency vehicle dispatching system for an electric utility in Chile. Journal of the Operational Research Society, 50(7), 690\u2013696.","DOI":"10.1057\/palgrave.jors.2600746"},{"key":"5459_CR38","first-page":"527","volume":"2","author":"T Zhang","year":"2002","unstructured":"Zhang, T. (2002). Covering number bounds of certain regularized linear function classes. Journal of Machine Learning Research, 2, 527\u2013550.","journal-title":"Journal of Machine Learning Research"},{"key":"5459_CR39","unstructured":"Zhou, D., Weston, J., Gretton, A., Bousquet, O., & Sch\u00f6lkopf, B. (2004). Ranking on data manifolds. In S. Thrun, L. K. Saul, & B. Sch\u00f6lkopf (Eds.), Advances in neural information processing systems (Vol. 16, pp. 169\u2013176). Cambridge, MA: MIT Press."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5459-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-014-5459-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-014-5459-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T21:40:39Z","timestamp":1559338839000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-014-5459-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,6,28]]},"references-count":39,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["5459"],"URL":"https:\/\/doi.org\/10.1007\/s10994-014-5459-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,6,28]]}}}