{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T13:39:06Z","timestamp":1740145146300,"version":"3.37.3"},"reference-count":49,"publisher":"Springer Science and Business Media LLC","issue":"9","license":[{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T00:00:00Z","timestamp":1710720000000},"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":["Optim Lett"],"published-print":{"date-parts":[[2024,12]]},"DOI":"10.1007\/s11590-024-02100-5","type":"journal-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T20:01:28Z","timestamp":1710792088000},"page":"2051-2078","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning to project in a criterion space search algorithm: an application to multi-objective binary linear programming"],"prefix":"10.1007","volume":"18","author":[{"given":"Alvaro","family":"Sierra-Altamiranda","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5416-6960","authenticated-orcid":false,"given":"Hadi","family":"Charkhgard","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Iman","family":"Dayarian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Eshragh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sorna","family":"Javadi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,3,18]]},"reference":[{"issue":"1","key":"2100_CR1","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1287\/ijoc.2016.0723","volume":"29","author":"AM Alvarez","year":"2017","unstructured":"Alvarez, A.M., Louveaux, Q., Wehenkel, L.: A machine learning-based approximation of strong branching. INFORMS J. Comput. 29(1), 185\u2013195 (2017)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2100_CR2","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."},{"issue":"4","key":"2100_CR3","doi-asserted-by":"publisher","first-page":"735","DOI":"10.1287\/ijoc.2015.0657","volume":"27","author":"N Boland","year":"2015","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: A criterion space search algorithm for biobjective integer programming: the balanced box method. INFORMS J. Comput. 27(4), 735\u2013754 (2015)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2100_CR4","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/s12532-015-0093-3","volume":"8","author":"N Boland","year":"2016","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: The L-shape search method for triobjective integer programming. Math. Program. Comput. 8(2), 217\u2013251 (2016)","journal-title":"Math. Program. Comput."},{"issue":"3","key":"2100_CR5","doi-asserted-by":"publisher","first-page":"904","DOI":"10.1016\/j.ejor.2016.02.037","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: A new method for optimizing a linear function over the efficient set of a multiobjective integer program. Eur. J. Oper. Res. 260(3), 904\u2013919 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2100_CR6","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.ejor.2016.03.035","volume":"260","author":"N Boland","year":"2017","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: The quadrant shrinking method: a simple and efficient algorithm for solving tri-objective integer programs. Eur. J. Oper. Res. 260(3), 873\u2013885 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"3","key":"2100_CR7","doi-asserted-by":"publisher","first-page":"858","DOI":"10.1016\/j.ejor.2018.10.034","volume":"274","author":"N Boland","year":"2019","unstructured":"Boland, N., Charkhgard, H., Savelsbergh, M.: Preprocessing and cut generation techniques for multi-objective binary programming. Eur. J. Oper. Res. 274(3), 858\u2013875 (2019)","journal-title":"Eur. J. Oper. Res."},{"key":"2100_CR8","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010, pp. 177\u2013186. Springer (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"1","key":"2100_CR9","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."},{"issue":"1","key":"2100_CR10","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1017\/S1446181118000275","volume":"61","author":"H Charkhgard","year":"2019","unstructured":"Charkhgard, H., Eshragh, A.: A new approach to select the best subset of predictors in linear regression modeling: bi-objective mixed integer linear programming. ANZIAM J. 61(1), 64\u201375 (2019)","journal-title":"ANZIAM J."},{"key":"2100_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/s10288-017-0354-2","volume":"16","author":"H Charkhgard","year":"2018","unstructured":"Charkhgard, H., Talebian, M., Savelsbergh, M.: Nondominated nash points: application of biobjective mixed integer programming. 4OR - A Q. J. Oper. Res. 16, 151\u2013171 (2018)","journal-title":"4OR - A Q. J. Oper. Res."},{"issue":"4","key":"2100_CR12","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10288-019-00429-7","volume":"18","author":"H Charkhgard","year":"2020","unstructured":"Charkhgard, H., Takalloo, M., Haider, Z.: Bi-objective autonomous vehicle repositioning problem with travel time uncertainty. 4OR - A Q. J. Oper. Res. 18(4), 477\u2013505 (2020)","journal-title":"4OR - A Q. J. Oper. Res."},{"issue":"Dec","key":"2100_CR13","first-page":"265","volume":"2","author":"K Crammer","year":"2001","unstructured":"Crammer, K., Singer, Y.: On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. 2(Dec), 265\u2013292 (2001)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"2100_CR14","doi-asserted-by":"publisher","first-page":"841","DOI":"10.1016\/j.ejor.2016.05.029","volume":"260","author":"K D\u00e4chert","year":"2017","unstructured":"D\u00e4chert, K., Klamroth, K., Lacour, R., Vanderpooten, D.: Efficient computation of the search region in multi-objective optimization. Eur. J. Oper. Res. 260(3), 841\u2013855 (2017)","journal-title":"Eur. J. Oper. Res."},{"issue":"1","key":"2100_CR15","doi-asserted-by":"publisher","first-page":"81","DOI":"10.1016\/j.orl.2017.11.011","volume":"46","author":"R Dai","year":"2018","unstructured":"Dai, R., Charkhgard, H.: A two-stage approach for bi-objective integer linear programming. Oper. Res. Lett. 46(1), 81\u201387 (2018)","journal-title":"Oper. Res. Lett."},{"key":"2100_CR16","unstructured":"He, H., Daume III, H., Eisner, J.M.: Learning to search in branch and bound algorithms. In: Advances in Neural Information Processing Systems, pp. 3293\u20133301 (2014)"},{"key":"2100_CR17","first-page":"1152","volume":"7","author":"F Hutter","year":"2007","unstructured":"Hutter, F., Hoos, H.H., St\u00fctzle, T.: Automatic algorithm configuration based on local search. AAAI 7, 1152\u20131157 (2007)","journal-title":"AAAI"},{"key":"2100_CR18","doi-asserted-by":"crossref","unstructured":"Hutter, F., Hoos, H.H., Leyton-Brown, K.: Automated configuration of mixed integer programming solvers. In: International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 186\u2013202. Springer (2010)","DOI":"10.1007\/978-3-642-13520-0_23"},{"key":"2100_CR19","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Le Bodic, P., Song, L., Nemhauser, G.L., Dilkina, B.N.: Learning to branch in mixed integer programming. In: AAAI, pp. 724\u2013731 (2016)","DOI":"10.1609\/aaai.v30i1.10080"},{"key":"2100_CR20","doi-asserted-by":"crossref","unstructured":"Khalil, E.B., Dilkina, B., Nemhauser, G.L., Ahmed, S., Shao, Y.: Learning to run heuristics in tree search. In: Proceedings of the International Joint Conference on Artificial Intelligence. AAAI Press, Melbourne, Australia (2017)","DOI":"10.24963\/ijcai.2017\/92"},{"issue":"3","key":"2100_CR21","doi-asserted-by":"publisher","first-page":"479","DOI":"10.1016\/j.ejor.2013.08.001","volume":"232","author":"G Kirlik","year":"2014","unstructured":"Kirlik, G., Say\u0131n, S.: A new algorithm for generating all nondominated solutions of multiobjective discrete optimization problems. Eur. J. Oper. Res. 232(3), 479\u2013488 (2014)","journal-title":"Eur. J. Oper. Res."},{"key":"2100_CR22","unstructured":"Le, Q.V., Ngiam, J., Coates, A., Lahiri, A., Prochnow, B., Ng, A.Y.: On optimization methods for deep learning. In: Proceedings of the 28th International Conference on International Conference on Machine Learning, pp. 265\u2013272. Omnipress (2011)"},{"key":"2100_CR23","doi-asserted-by":"publisher","first-page":"745","DOI":"10.1613\/jair.4726","volume":"53","author":"M Lindauer","year":"2015","unstructured":"Lindauer, M., Hoos, H.H., Hutter, F., Schaub, T.: Autofolio: an automatically configured algorithm selector. J. Artif. Intell. Res. 53, 745\u2013778 (2015)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"2100_CR24","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10898-012-9955-7","volume":"57","author":"B Lokman","year":"2013","unstructured":"Lokman, B., K\u00f6ksalan, M.: Finding all nondominated points of multi-objective integer programs. J. Global Optim. 57(2), 347\u2013365 (2013)","journal-title":"J. Global Optim."},{"key":"2100_CR25","doi-asserted-by":"crossref","unstructured":"Malitsky, Y., Sabharwal, A., Samulowitz, H., Sellmann, M.: Non-model-based algorithm portfolios for sat. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 369\u2013370. Springer (2011)","DOI":"10.1007\/978-3-642-21581-0_33"},{"key":"2100_CR26","doi-asserted-by":"crossref","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Instance-based selection of policies for sat solvers. In: International Conference on Theory and Applications of Satisfiability Testing, pp. 326\u2013340. Springer (2009)","DOI":"10.1007\/978-3-642-02777-2_31"},{"issue":"4","key":"2100_CR27","doi-asserted-by":"publisher","first-page":"457","DOI":"10.1007\/s10462-011-9290-2","volume":"40","author":"M Nikoli\u0107","year":"2013","unstructured":"Nikoli\u0107, M., Mari\u0107, F., Jani\u010di\u0107, P.: Simple algorithm portfolio for sat. Artif. Intell. Rev. 40(4), 457\u2013465 (2013)","journal-title":"Artif. Intell. Rev."},{"key":"2100_CR28","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.ejor.2008.10.023","volume":"199","author":"M \u00d6zlen","year":"2009","unstructured":"\u00d6zlen, M., Azizo\u011flu, M.: Multi-objective integer programming: a general approach for generating all non-dominated solutions. Eur. J. Oper. Res. 199, 25\u201335 (2009)","journal-title":"Eur. J. Oper. Res."},{"issue":"2","key":"2100_CR29","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1007\/s10957-013-0364-y","volume":"160","author":"M \u00d6zlen","year":"2013","unstructured":"\u00d6zlen, M., Burton, B.A., MacRae, C.A.G.: Multi-objective integer programming: an improved recursive algorithm. J. Optim. Theory Appl. 160(2), 470\u2013482 (2013)","journal-title":"J. Optim. Theory Appl."},{"issue":"12","key":"2100_CR30","doi-asserted-by":"publisher","first-page":"2302","DOI":"10.1287\/mnsc.1100.1248","volume":"56","author":"\u00d6 \u00d6zpeynirci","year":"2010","unstructured":"\u00d6zpeynirci, \u00d6., K\u00f6ksalan, M.: An exact algorithm for finding extreme supported nondominated points of multiobjective mixed integer programs. Manage. Sci. 56(12), 2302\u20132315 (2010)","journal-title":"Manage. Sci."},{"key":"2100_CR31","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., Blondel, M., Prettenhofer, P., Weiss, R., Dubourg, V., Vanderplas, J., Passos, A., Cournapeau, D., Brucher, M., Perrot, M., Duchesnay, E.: Scikit-learn: machine learning in Python. J. Mach. Learn. Res. 12, 2825\u20132830 (2011)","journal-title":"J. Mach. Learn. Res."},{"issue":"3","key":"2100_CR32","doi-asserted-by":"publisher","first-page":"1721","DOI":"10.1016\/j.eswa.2007.01.029","volume":"34","author":"A Prinzie","year":"2008","unstructured":"Prinzie, A., Van den Poel, D.: Random forests for multiclass classification: random multinomial logit. Expert Syst. Appl. 34(3), 1721\u20131732 (2008)","journal-title":"Expert Syst. Appl."},{"issue":"3","key":"2100_CR33","doi-asserted-by":"publisher","first-page":"856","DOI":"10.1016\/j.ejor.2017.01.032","volume":"260","author":"A Przybylski","year":"2017","unstructured":"Przybylski, A., Gandibleux, X.: Multi-objective branch and bound. Eur. J. Oper. Res. 260(3), 856\u2013872 (2017)","journal-title":"Eur. J. Oper. Res."},{"key":"2100_CR34","doi-asserted-by":"crossref","unstructured":"Rice, J.R.: The algorithm selection problem. In: Advances in Computers, Vol. 15, pp. 65\u2013118. Elsevier (1976)","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"2100_CR35","doi-asserted-by":"crossref","unstructured":"Roth, D., Yih, W.-t.: Integer linear programming inference for conditional random fields. In: Proceedings of the 22nd International Conference on Machine Learning, pp. 736\u2013743. ACM (2005)","DOI":"10.1145\/1102351.1102444"},{"key":"2100_CR36","doi-asserted-by":"crossref","unstructured":"Sabharwal, A., Samulowitz, H., Reddy, C.: Guiding combinatorial optimization with UCT. In: International Conference on Integration of Artificial Intelligence (AI) and Operations Research (OR) Techniques in Constraint Programming, pp. 356\u2013361. Springer (2012)","DOI":"10.1007\/978-3-642-29828-8_23"},{"key":"2100_CR37","doi-asserted-by":"crossref","unstructured":"Serafini, P.: Some considerations about computational complexity for multi objective combinatorial problems. In: Recent Advances and Historical Development of Vector Optimization, pp. 222\u2013232. Springer (1987)","DOI":"10.1007\/978-3-642-46618-2_15"},{"issue":"4","key":"2100_CR38","doi-asserted-by":"publisher","first-page":"823","DOI":"10.1287\/ijoc.2018.0851","volume":"31","author":"A Sierra-Altamiranda","year":"2019","unstructured":"Sierra-Altamiranda, A., Charkhgard, H.: A new exact algorithm to optimize a linear function over the set of efficient solutions for bi-objective mixed integer linear programming. INFORMS J. Comput. 31(4), 823\u2013840 (2019)","journal-title":"INFORMS J. Comput."},{"issue":"2","key":"2100_CR39","doi-asserted-by":"publisher","first-page":"945","DOI":"10.1111\/itor.12692","volume":"27","author":"A Sierra-Altamiranda","year":"2020","unstructured":"Sierra-Altamiranda, A., Charkhgard, H.: Ooesalgorithm.jl: a julia package for optimizing a linear function over the set of efficient solutions for biobjective mixed integer linear programming. Int. Trans. Oper. Res. 27(2), 945\u2013957 (2020)","journal-title":"Int. Trans. Oper. Res."},{"key":"2100_CR40","unstructured":"Snoek, J., Larochelle, H., Adams, R.P.: Practical bayesian optimization of machine learning algorithms. In: Advances in Neural Information Processing Systems, pp. 2951\u20132959 (2012)"},{"key":"2100_CR41","doi-asserted-by":"publisher","first-page":"204","DOI":"10.1016\/j.cor.2016.03.001","volume":"72","author":"B Soylu","year":"2016","unstructured":"Soylu, B., Y\u0131ld\u0131z, G.B.: An exact algorithm for biobjective mixed integer linear programming problems. Comput. Oper. Res. 72, 204\u2013213 (2016)","journal-title":"Comput. Oper. Res."},{"key":"2100_CR42","volume-title":"Optimization for Machine Learning","author":"S Sra","year":"2012","unstructured":"Sra, S., Nowozin, S., Wright, S.J.: Optimization for Machine Learning. MIT Press, Cambridge (2012)"},{"key":"2100_CR43","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1111\/j.2517-6161.1996.tb02080.x","volume":"58","author":"R Tibshirani","year":"1996","unstructured":"Tibshirani, R.: Regression shrinkage and selection via the lasso. J. Roy. Stat. Soc. B 58, 267\u2013288 (1996)","journal-title":"J. Roy. Stat. Soc. B"},{"key":"2100_CR44","doi-asserted-by":"crossref","unstructured":"Tsochantaridis, I., Hofmann, T., Joachims, T., Altun, Y.: Support vector machine learning for interdependent and structured output spaces. In: Proceedings of the Twenty-first International Conference on Machine Learning, pp. 104. ACM (2004)","DOI":"10.1145\/1015330.1015341"},{"key":"2100_CR45","doi-asserted-by":"crossref","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla-07: the design and analysis of an algorithm portfolio for sat. In: International Conference on Principles and Practice of Constraint Programming, pp. 712\u2013727. Springer (2007)","DOI":"10.1007\/978-3-540-74970-7_50"},{"key":"2100_CR46","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: portfolio-based algorithm selection for sat. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"2100_CR47","doi-asserted-by":"crossref","unstructured":"Xu, L., Hoos, H., Leyton-Brown, K.: Hydra: automatically configuring algorithms for portfolio-based selection. In: Twenty-Fourth AAAI Conference on Artificial Intelligence (2010)","DOI":"10.1609\/aaai.v24i1.7565"},{"key":"2100_CR48","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Hydra-mip: Automated algorithm configuration and selection for mixed integer programming. In: RCRA Workshop on Experimental Evaluation of Algorithms for Solving Problems with Combinatorial Explosion at the International Joint Conference on Artificial Intelligence (IJCAI), pp. 16\u201330 (2011)"},{"key":"2100_CR49","unstructured":"Xu, L., Hutter, F., Shen, J., Hoos, H.H., Leyton-Brown, K.: Satzilla2012: Improved algorithm selection based on cost-sensitive classification models. In: Proceedings of SAT challenge, pp. 57\u201358 (2012)"}],"container-title":["Optimization Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02100-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11590-024-02100-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11590-024-02100-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,15]],"date-time":"2024-10-15T10:27:58Z","timestamp":1728988078000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11590-024-02100-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,3,18]]},"references-count":49,"journal-issue":{"issue":"9","published-print":{"date-parts":[[2024,12]]}},"alternative-id":["2100"],"URL":"https:\/\/doi.org\/10.1007\/s11590-024-02100-5","relation":{},"ISSN":["1862-4472","1862-4480"],"issn-type":[{"type":"print","value":"1862-4472"},{"type":"electronic","value":"1862-4480"}],"subject":[],"published":{"date-parts":[[2024,3,18]]},"assertion":[{"value":"6 October 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 February 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 March 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}