{"id":70,"date":"2020-09-16T17:08:34","date_gmt":"2020-09-16T17:08:34","guid":{"rendered":"http:\/\/grupo.us.es\/fqm331\/grupo\/?page_id=70"},"modified":"2024-10-17T12:13:29","modified_gmt":"2024-10-17T12:13:29","slug":"publicaciones","status":"publish","type":"page","link":"https:\/\/grupo.us.es\/fqm331\/publicaciones\/","title":{"rendered":"Publicaciones"},"content":{"rendered":"\t\t<div data-elementor-type=\"wp-page\" data-elementor-id=\"70\" class=\"elementor elementor-70\" data-elementor-settings=\"[]\">\n\t\t\t\t\t\t<div class=\"elementor-inner\">\n\t\t\t\t\t\t\t<div class=\"elementor-section-wrap\">\n\t\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-f2090c0 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"f2090c0\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-e355b1a\" data-id=\"e355b1a\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-f39dcdb elementor-widget elementor-widget-spacer\" data-id=\"f39dcdb\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-d7f8802 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"d7f8802\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-c8fd032\" data-id=\"c8fd032\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-0c3fdab elementor-widget elementor-widget-heading\" data-id=\"0c3fdab\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\">Publicaciones<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-da28ebc elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"da28ebc\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-2532824\" data-id=\"2532824\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-35c84d4 elementor-widget-divider--view-line elementor-widget elementor-widget-divider\" data-id=\"35c84d4\" data-element_type=\"widget\" data-widget_type=\"divider.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-divider\">\n\t\t\t<span class=\"elementor-divider-separator\">\n\t\t\t\t\t\t<\/span>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-ba4a6c0 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"ba4a6c0\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-be39a55\" data-id=\"be39a55\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-0463ee4 elementor-widget elementor-widget-heading\" data-id=\"0463ee4\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\">Publicaciones en libros y revistas<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-56dd2f3 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"56dd2f3\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-4c08523\" data-id=\"4c08523\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-0eacad8 elementor-tabs-view-horizontal elementor-widget elementor-widget-tabs\" data-id=\"0eacad8\" data-element_type=\"widget\" data-widget_type=\"tabs.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-tabs\">\n\t\t\t<div class=\"elementor-tabs-wrapper\" role=\"tablist\" >\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1531\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-1531\" aria-expanded=\"false\"><a href=\"\">2016<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1532\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1532\" aria-expanded=\"false\"><a href=\"\">2017<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1533\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1533\" aria-expanded=\"false\"><a href=\"\">2018<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1534\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1534\" aria-expanded=\"false\"><a href=\"\">2019<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1535\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1535\" aria-expanded=\"false\"><a href=\"\">2020<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1536\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1536\" aria-expanded=\"false\"><a href=\"\">2021<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1537\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1537\" aria-expanded=\"false\"><a href=\"\">2022<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1538\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1538\" aria-expanded=\"false\"><a href=\"\">2023<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1539\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"9\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1539\" aria-expanded=\"false\"><a href=\"\">2024<\/a><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t\t<div class=\"elementor-tabs-content-wrapper\" role=\"tablist\" aria-orientation=\"vertical\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-1531\" aria-expanded=\"false\">2016<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1531\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1531\" tabindex=\"0\" hidden=\"false\"><ul><li>Labbe, Martine; Ponce-L\u00f3pez, Diego; Puerto-Albandoz, Justo. \u00abA Comparative Study of Formulations and Solution Methods for the Discrete Ordered p-Median Problem\u00bb.Computers &amp; Operations Research n.78 230-242 (2016).<\/li><li>Fern\u00e1ndez-areizaga, Elena; Pozo, Miguel A.; Puerto-Albandoz, Justo; Scozzari, Andrea. \u00abOrdered Weighted Average Optimization in Multiobjective Spanning Tree Problems\u00bbEuropean Journal Of Operational Research Vol 260 n.3 886-903 (2016).<\/li><li>Puerto-Albandoz, Justo; Rodriguez-Chia, Antonio Manuel; Tamir, Arie. \u00abRevisiting k-sum Optimization\u00bb. Mathematical Programming, Series B 1-26 (2016).<\/li><li>Lari, Isabella; Puerto-Albandoz, Justo; Ricca, Federica; Scozzari, Andrea. \u00abAlgorithms for uniform centered partitions of trees\u00bb.Electronic Notes In Discrete Mathematics Vol 55 37-40 (2016).<\/li><li>Puerto-Albandoz, Justo; El Haj Benali, Safae. \u00abContinuous multifacility ordered median location problems\u00bb. European Journal Of Operational Research Vol 250 n.1 56-64 (2016).<\/li><li>Puerto-Albandoz, Justo; Ramos-Gallego, Ana Bel\u00e9n; Rodriguez-Chia, Antonio Manuel; Sanchez-Gil, Maria Carmen. \u00abOrdered Median Hub Location Problems with Capacity Constraints\u00bb.Transportation Research. Part C: Emerging Technologies: An International Journal Vol 70 142-156 (2016).<\/li><li>Luisa I. Mart\u00ednez-Merino; Maria Albareda-Sambola; Antonio M. Rodr\u00edguez-Ch\u00eda. 2016. Location of emergency facilities with uncertainty in the demands Trends in differential equations and applications. Springer. 8, pp.339-356. ISBN 978-3-319-32012-0.<\/li><li>Perea, F., Ruiz, R., Katragjini, K. (2016) Integer programming, clustering, and local search approaches for grouping urban waste collection sites. Bulletin of the Spanish Society of Statistics and Operations Research 32 (3), pp. 203\u2014224.<\/li><li>Maheut, J., Garcia-Sabater, J.P., Morant, J., Perea, F. (2016) Definition and Evaluation of the difficulty of the Car Sequencing Problem. Working Papers on Operations Management 7,(1), pp 31\u201442.<\/li><li>Blanco, V. and Salmer\u00f3n, R. (2016). Small samples in linear regression: micronumerosity. Rect@ 17, 167-177.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1532\" aria-expanded=\"false\">2017<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1532\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1532\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Fanjul, L., Perea, F., Ruiz, R. (2017) Exact algorithms and matheuristics for scheduling problems with additional resources. European Journal of Operational Research 260(2) 482&#8211;493. <br \/>IF: 3.428, 12\/83 in Operations Research and Management Science (Q1).<\/li><li>Proceedings of VIII International Workshop on Locational Analysis and Related Problems. M. Baldomero, I. Espejo, L.I. Mart\u00ednez, A.M. Rodr\u00edguez-Ch\u00eda y D. Ruiz. Universidad de C\u00e1diz (2017). ISBN: 978-84-697-5263-0<\/li><li>Luisa I. Mart\u00ednez-Merino; Maria Albareda-Sambola; Antonio M. Rodr\u00edguez-Ch\u00eda. 2017. The probabilistic p-center problem: Planning service for potential customers European Journal of Operational Research. 262-2, pp.509-520. ISSN 0377-2217.<\/li><li>De-Los-Santos, A., Laporte, G., Mesa, J.A., Perea, F. (2017) The Railway Line Frequency and Size Setting Problem. Public Transport 9:(1-2) 33\u201453.<\/li><li>Laporte, Gilbert; Ortega-Riejos, Francisco; Pozo, Miguel A.; Puerto-Albandoz, Justo. \u00abMulti-objective integration of timetables, vehicle schedules and user routings in a transit network\u00bb Transportation Research. Part B: Methodological Vol 78 94-112 (2017).<\/li><li>Puerto-Albandoz, Justo; Perea-Rojas Marcos, Federico. \u00abOn minimax and Pareto optimal security payoffs in multicriteria games\u00bb Journal of Mathematical Analysis and Applications (2017).<\/li><li>Benati, Stefano; Puerto-Albandoz, Justo; Rodriguez-Chia, Antonio Manuel. \u00abClustering data that are graph connected\u00bb. European Journal Of Operational Research Vol 261 n.1 43-53 (2017).<\/li><li>Mallozzi, Lina; Puerto-Albandoz, Justo. \u00abThe geometry of optimal partitions in location problems\u00bb. Optimization Letters (2017).<\/li><li>Blanco, Victor; Puerto-Albandoz, Justo; Ponce-L\u00f3pez, Diego. \u00abContinuous location under the effect of refraction\u00bb. Mathematical Programming, Series B Vol 161 n.1 33-72 (2017).<\/li><li>Garc\u00eda-nove, Eva M.; Alcaraz, Javier; Landete, Mercedes; Monge, Francisco J.; Puerto-Albandoz, Justo. \u00abRank aggregation in cyclic sequences\u00bb Optimization Letters Optimization Lettersol 11 n.4 667-668 (2017).<\/li><li>Blanco, V., Fern\u00e1ndez, E. and Puerto, J. (2017). Minimum Spanning Trees with Neighborhoods: Mathematical Programming formulations and solution methods. European J. of Operational Research.262(3), 863-878.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1533\" aria-expanded=\"false\">2018<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1533\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1533\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Puerto, J., Perea, F. (2018) On minimax and Pareto optimal security payoffs in multicriteria games. Journal of Mathematical Analysis and Applications. 245(2): 1634\u20141648. <br \/>IF: 1.188, 117\/254 in Mathematics, Applied, 65\/313 in Mathematics (Q1).<\/li><li>Alfredo Mar\u00edn; Luisa I. Mart\u00ednez-Merino; Antonio M. Rodr\u00edguez-Ch\u00eda; Francisco Saldanha-da-Gama. 2018. Multi-period Stochastic Covering Location Problems: modeling framework and solution approach European Journal of Operational<br \/>Research. 268-2, pp.432-449. ISSN 0377-2217.<\/li><li>Igor Averbakh; Oded Berman; Marina Leal Palazon. 2018. Improved complexity results for the robust mean absolute deviation problem on networks with linear vertex weights. Discrete Applied Mathematics. 230, pp.193-199.<\/li><li>Ortega-Riejos, Francisco; Mesa-L\u00f3pez-Colmenar, Juan Antonio; Pozo, Miguel A.; Puerto-Albandoz, Justo. \u00abRailway traffic disturbance management by means of control strategies applied to operations in the transit system\u00bb. International Journal of Transport Development and Integration Vol 2 362-372 (2018).<\/li><li>Schnepper, Teresa; Klamroth, Kathrin; Stiglmayr, Michael; Puerto-Albandoz, Justo. \u00abExact Algorithms for Handling Outliers in Center Location Problems on Networks Using k-max Functions\u00bb. European Journal of Operational Research Vol 273 441-451 (2018).<\/li><li>Lari, Isabella; Puerto-Albandoz, Justo; Ricca, Federica; Scozzari, Andrea. \u00abUniform and most uniform partitions of trees\u00bb. Discrete Optimization Vol 30 96-107 (2018).<\/li><li>Ponce-L\u00f3pez, Diego; Puerto-Albandoz, Justo; Ricca, Federica; Scozzari, Andrea. \u00abMathematical Programming formulations for the efficient solution of the k-sum approval voting problem\u00bb. Computers and Operations Research Vol 98 127-136 (2018).<\/li><li>Puerto-Albandoz, Justo; Ricca, Federica; Scozzari, Andrea. \u00abExtensive Facility Location problems on Networks: An updated review\u00bb. TOP Vol 26 187-226 (2018).<\/li><li>Conde, Eduardo; Leal, Marina; Puerto-Albandoz, Justo. \u00abA minmax regret version of the time-dependent shortest path problem\u00bb. European Journal of Operational Research Vol 270 968-981 (2018).<\/li><li>Blanco, Victor; Puerto-Albandoz, Justo; Salmer\u00f3n, Rom\u00e1n. \u00abLocating hyperplanes to fitting set of points: A general framework\u00bb. Computers and Operations Research Vol 95 172-193 (2018).<\/li><li>Benati, Stefano; Garc\u00eda-Quiles, Sergio; Puerto-Albandoz, Justo. \u00abMixed Integer Linear Programming and Heuristic Methods for Feature Selection in Clustering\u00bb. Journal of the Operational Research Society Vol 69 1379-1395 (2018).<\/li><li>Ortega-Riejos, Francisco; Pozo, Miguel A.; Puerto-Albandoz, Justo. \u00abOn-line timetable rescheduling in a transit line\u00bb. Transportation Science (2018).<\/li><li>Blanco, V, Salmer\u00f3n, R. and G\u00f3mez-Haro, S. (2018). A multicriteria selection system based on player performance. Case study: the Spanish ACB Basketball League. Group Decision and Negotiation 27(6), 1029-1046.<\/li><li>Blanco, V. and Perez-Sanchez, JM (2018). On the aggregation of experts&#8217; information in Bonus-Malus systems. ASTIN Bulletin (The Journal of the International Actuarial Association) 48(1), 311-337. 2018.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1534\" aria-expanded=\"false\">2019<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1534\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1534\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Mallozzi, Lina; Puerto-Albandoz, Justo; Rodr\u00edguez-Madrena, Mois\u00e9s. \u00abOn Location-Allocation Problems for Dimensional Facilities\u00bb. Journal of Optimization Theory and Applications, VOL 182 730-767 (2019).<\/li><li>Martine Labb\u00e9; Marina Leal Palaz\u00f3n; Justo Puerto Albandoz. 2019. New models for the location of controversial facilities: A bilevel<br \/>programming approach. Computers &amp; Operations Research. 107, pp.95-106.<\/li><li>Martine Labb\u00e9; Luisa I. Mart\u00ednez-Merino; Antonio M. Rodr\u00edguez-Ch\u00eda. 2019. Mixed Integer Linear Programming for Feature Selection in Support Vector Machine Discrete Applied Mathematics. 261, pp.246-304. ISSN 0166-218X.<\/li><li>Maria Albareda-Sambola; Luisa I. Mart\u00ednez-Merino; Antonio M. Rodr\u00edguez-Ch\u00eda. 2019. The Stratified p-center problem Computers &amp; Operations Research. 108, pp.213-225. ISSN 0305-0548.<\/li><li>Proceedings of IX International Workshop on Locational Analysis and Related Problems (2019). M. Baldomero, I. Espejo, L.I. Mart\u00ednez, J.M. Mu\u00f1oz y A.M. Rodr\u00edguez-Ch\u00eda. Universidad de C\u00e1diz (2019). ISBN: 978-84-09-07742-7.<\/li><li>Fanjul-Peyro, L, Ruiz, R., Perea, F. (2019) Reformulations and an exact algorithm for unrelated parallel machine scheduling problems with setup times. Computers and Operations Research 101:173&#8211;182. <br \/>IF: 3.424. 69.27% in Computer Science, Interdisciplinary Applications; 71.88% in Engineering, Industrial; 75.30% in Operations Research and Management Science (Q1).<\/li><li>Perea, F., Puerto, J. (2019) A heuristic procedure for computing the nucleolus. Computers and Operations Research 112:1&#8211;9. <br \/>IF: 3.424. 69.27% in Computer Science, Interdisciplinary Applications; 71.88% in Engineering, Industrial; 75.30% in Operations Research and Management Science (Q1).<\/li><li>Maravillo, H\u00e9ctor, Camacho-Vallejo, Jos\u00e9-Fernando; Puerto-Albandoz, Justo; Labb\u00e9, Martine.<br \/>\u00abA market regulation bilevel problem: a case study of the Mexican petrochemical industry\u00bb.<br \/>Omega Vol 97 (2019).<\/li><li>Benati, S., L\u00f3pez-Bl\u00e1zquez, F., Puerto, J.<br \/>6602208900;6603730623;7003467090;<br \/>A stochastic approach to approximate values in cooperative games<br \/>(2019) European Journal of Operational Research, 279 (1), pp. 93-106. Cited 8 times.<br \/>https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85066939266&amp;doi=10.1016%2fj.ejor.2019.05.027&amp;partnerID=40&amp;md5=bf5c2ba27dce3890527107ac9a00fb14<br \/>DOI: 10.1016\/j.ejor.2019.05.027<br \/>DOCUMENT TYPE: Article<br \/>PUBLICATION STAGE: Final<br \/>SOURCE: Scopus<\/li><li>Labb\u00e9, Martine; Pozo, Miguel A.; Puerto-Albandoz, Justo.<br \/>\u00abComputational comparisons of different formulations for the Stackelberg Minimum Spanning Tree Game\u00bb.<br \/>International Transactions in Operations Research Vol 28 48-69 (2019).<\/li><li>Fern\u00e1ndez, Elena; Hinojosa, Yolanda; Puerto-Albandoz, Justo; Saldanha-da-Gama, Francisco.<br \/>\u00abNew algorithmic framework for conditional value at risk: application to stochastic fixed-charge transportation\u00bb.<br \/>European Journal of Operational Research Vol 227 215-226 (2019).<\/li><li>Blanco, V., Jap\u00f3n, A., and Puerto, J. (2019). Optimal Arrangements of Hyperplanes for SVM-based Multiclass Classification. Advances in Data Analysis and Classification.<\/li><li>Blanco, V. (2019). Ordered p-Median problems with neighborhoods. Computational Optimization and Applications 73(2), 603\u2013645.<\/li><li>Blanco, V and Mar\u00edn, A (2019). Upgrading nodes in tree-shaped hub location. Computers &amp; OR 102, 75-90.<\/li><li>Arana, M. and Blanco, V. (2019). A fully fuzzy framework for minimax mixed integer linear programming. Computers &amp; Industrial Engineering 128, 170-179.<\/li><li>L\u00f3pez-Bl\u00e1zquez, F., Su, N.-C., Weso\u0142owski, J.<br \/>6603730623;23467905400;7005546641;<br \/>Order statistics from overlapping samples: bivariate densities and regression properties<br \/>(2019) Statistics, 53 (5), pp. 1052-1081. <br \/>https:\/\/www.scopus.com\/inward\/record.uri?eid=2-s2.0-85063963834&amp;doi=10.1080%2f02331888.2019.1599378&amp;partnerID=40&amp;md5=8adc6fffe74607b9acd68381929fb227<br \/>DOI: 10.1080\/02331888.2019.1599378<br \/>DOCUMENT TYPE: Article<br \/>PUBLICATION STAGE: Final<br \/>OPEN ACCESS: All Open Access, Green<br \/>SOURCE: Scopus<\/li><li>\u00a0<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1535\" aria-expanded=\"false\">2020<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1535\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1535\" tabindex=\"0\" hidden=\"hidden\"><ul><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Jap\u00f3n, A. &amp; Puerto, J. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Optimal arrangements of hyperplanes for SVM-based multiclass classification. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Adv Data Anal Classif 14, 175\u2013199 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.06 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Puerto-Albandoz, Justo; Rodr\u00edguez-Madrena, Mois\u00e9s; Scozzari, Andrea. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Clustering and portfolio selection problems: A unified framework. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Operations Research, VOL 117 104891 (2020) <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.85 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Marta Baldomero-Naranjo; Luisa I. Mart\u00ednez-Merino; Antonio M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Tightening big Ms in integer programming formulations for support vector machines with ramp loss. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research\u00bb. 286-1, pp.84-100. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Yepes, J.C., Perea, F., Villa, F., Caballero J.P. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> GRASP algorithm for the unrelated parallel machine scheduling problem with setup times and additional resources. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Expert Systems With Applications 141, 1\u201412. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>8.67 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Perea, F., Menezes, M., Mesa, J.A., Rubio-del-Rey, F. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Transportation infrastructure network design in presence of modal competition: computational complexity classification and a genetic algorithm. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>TOP 28:442\u2013474 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.17 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q3<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Le\u00f3n, J. Puerto, B. Vitoriano. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A risk-aversion approach for the Multiobjective Stochastic Programming <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Mathematics <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.26 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Autores: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Schnepper, Teresa; Klamroth, Kathrin; Puerto-Albandoz, Justo; Stiglmayr, Michael. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Local Analysis to Determine All Optimal Solutions of p-k-max Location Problems on Networks. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Discrete Applied Mathematics <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.62 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Mar\u00edn, Alfredo; Ponce, Diego; Puerto-Albandoz, Justo. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A fresh view on the Discrete Ordered Median Problem based on partial monotonicity. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>European Journal of Operational Research Vol 286 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Leal, Marina; Ponce, Diego; Puerto-Albandoz, Justo. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Portfolio problems with two levels decision-makers: Optimal portfolio selection with Pricing decisions on transaction costs. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research Vol 284 712-727 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Autores: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Puerto-Albandoz, Justo. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>An exact completely positive programming formulation for the Discrete Ordered Median Problem: An extended version. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research Vol 284 712-727 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Blanco, V\u00edctor; Conde, Eduardo; Hinojosa, Yolanda; Puerto-Albandoz, Justo. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>An optimization model for line planning and timetabling in automated urban metro subway networks. <\/i><\/span><\/span><span style=\"font-family: NewsGotT, serif;\"><i>A case study. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> OMEGA Vol 92. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.55 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Deleplanque, Samuel; Labb\u00e9, Martine; Ponce, Diego; Puerto-Albandoz, Justo. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A Branch-Price-and-Cut Procedure for the Discrete Ordered Median Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> INFORMS Journal on Computing Vol 32 531\u2013546 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.83 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>J.M. Mu\u00f1oz-Oca\u00f1a, A. Bouziane, F. Sakina, R.T. Baker, A.B. Hungr\u00eda, J.J. Calvino, A.M. Rodr\u00edguez-Ch\u00eda, M. Lopez-Haro. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Optimization of STEM-HAADF electron tomography reconstructions by parameter selection in compressed sensing Total Variation Minimization-based algorithms. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Particle and Particle Systems Characterization, 37. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>3 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>L. Escudero, J.F. Monge, A.M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>On pricing-based equilibrium for network expansion planning. A multi-period bilevel approach under uncertainty. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> European Journal of Operational Research, 287:262-279. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>V. Blanco, J. Puerto, A.M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>On lp-Support Vector Machines and Multidimensional Kernels. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Journal of Machine Learning Research, 21:1-29 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>9.03 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Arana-Jim\u00e9nez, M., Blanco, V., Fern\u00e1ndez, E. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> On the fuzzy maximal covering location problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research 283, 692-705. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><i> <\/i><span style=\"font-family: NewsGotT, serif;\"><span lang=\"es-ES\">6.02 <\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Cuartil:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Casta\u00f1o-Mart\u00ednez, A., L\u00f3pez-Blazquez, F., Pigueiras, G., Sordo, M.\u00c1. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Method for constructing and interpreting some weighted premium principles. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> ASTIN Bulletin, 50 (3), pp. 1037-1064. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2020 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 1.87 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1536\" aria-expanded=\"false\">2021<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1536\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1536\" tabindex=\"0\" hidden=\"hidden\"><ul><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Blanco, V., Jap\u00f3n, A., Ponce, D. &amp; Puerto, J. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> On the multisource hyperplanes location problem to fitting set of points. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers and Operations Research 128: 105124 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> J. A. Mesa, F. A. Ortega, R. Piedra, and M. A. Pozo. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Assessing the effectiveness of park-and-ride facilities on multimodal networks in smart cities <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Journal of the Operational Research Society, vol. 73(3), pp. 576\u2013586 <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2.65 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> M. Labb\u00e9, M. A. Pozo, and J. Puerto. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Computational comparisons of different formulations for the Stackelberg Minimum Spanning Tree Game. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> International Transactions in Operational Research, vol. 28(1), pp. 48\u201369. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 3.75 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> M. A. Pozo, J. Puerto, and A. M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> The Ordered Median Tree of Hubs Location Problem. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> TOP, vol. 29, pp. 78\u2013105. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2.17 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q3<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Autores:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Steven A. Gabriel; Marina Leal; Martin Schmidt. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> On linear bilevel optimization problems with complementarity-constrained lower levels. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Journal of the Operational Research Society. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2.65 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Eduardo Conde; Marina Leal. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> A robust optimization model for distribution network design under a mixed integer set of scenarios. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers &amp; Operations Research <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Justo Puerto Albandoz; Julio Gonz\u00e1lez D\u00edaz; Brais Gonz\u00e1lez Rodr\u00edguez; Marina Leal Palaz\u00f3n. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Global Optimization for Bilevel Portfolio Design: Economic Insights from the Dow Jones Index. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Omega. 102 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 7.55 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Autores:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Steven A. Gabriel; Marina Leal; Martin Schmidt. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Solving binary-constrained mixed complementarity problems using continuous reformulations. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers and Operations Research. Elsevier. 131, pp.1-12. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Marta Baldomero-Naranjo; Luisa I. Mart\u00ednez-Merino; Antonio M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> A robust SVM-based approach with feature selection and outliers detection for classication problems. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Expert Systems with Applications. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 8.67 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> I. Espejo, J. Puerto, A.M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> A comparative study of different formulations for the Capacitated Discrete Ordered Median Problem. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers &amp; Operations Research, 125. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Yepes, J.C., Perea, F., Ruiz, R., Villa, F. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Bi-objective parallel machine scheduling with additional resources during setups. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> European Journal of Operational Research 292:443-455. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 6.02 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> J. Puerto, F. Ricca, A. Scozzari. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Discrete Applied Mathematics Vol 289 78-92. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 1.62 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q2<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> L. Guardiola, A. Meca, J.Puerto. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Unitary Owen points in cooperative lot-sizing models with backlogging. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Mathematics. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2.26 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> L. Guardiola, A. Meca, J.Puerto. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Enforcing fair cooperation in production-inventory settings with heterogeneous agents. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Annals of Operations Research. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 3.91 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> L. Amorosi, J. Puerto, C. Valverde. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Coordinating drones with mothership vehicles: The mothership and drone routing problem with Graphs. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> CORS <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> J. Puerto, C. Valverde. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Routing for unmanned aerial vehicles: touring dimensional sets. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> European Journal of Operational Research <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 6.02 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> L. Guardiola, A. Meca, J.Puerto. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> The effect of consolidated periods in heterogeneous lot-sizing games. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> TOP <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 1.5 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Cuartil: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Q1<\/i><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> M. Baldomero, J. Kalcsics, A.M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Minmax Regret Maximal Covering Location Problems with Edge Demands. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers &amp; Operations Research, 130. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Blanco, V., Gazquez, R. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Continuous Maximal Covering Location with Interconnected Facilities <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computers &amp; Operations Research 132, 105310. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 4.85 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Blanco, V., Puerto, J. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Covering problems with polyellipsoids: A location analysis perspective. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> European Journal of Operational Research, 289(1), 44-58. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 6.02 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Autores:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Achour, W., Blanco, V., and Djamal, Ch. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> An improved algorithm to compute the omega-primality. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Optimization Letters 15, 97\u2013107. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 1.769 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Autores:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Benati S., Vittucci Marzetti G. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Voting power on a graph connected political space with an application to decision-making in the Council of the European Union. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> SOCIAL CHOICE AND WELFARE, vol. 2021, p. 733-761 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 0.98 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q2<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Autores:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Grassi R., Bartesaghi P., Benati S., Clemente G. P. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Multi-Attribute Community Detection in International Trade Network. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> NETWORKS AND SPATIAL ECONOMICS, vol. 21, p. 707-733. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2.48 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q1<\/i><\/span><\/span><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Autores:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> L\u00f3pez-Bl\u00e1zquez, F., Salamanca-Mi\u00f1o, B. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i> Automatic differentiation and maximal correlation of order statistics from discrete parents. <\/i><\/span><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> Computational Statistics, 36 (4), pp. 2889-2915. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>A\u00f1o:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 2021 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><i> 1.14 <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Cuartil: <\/i><\/span><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span style=\"font-size: medium;\"><span lang=\"en-US\"><i>Q2<\/i><\/span><\/span><\/span><\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1537\" aria-expanded=\"false\">2022<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1537\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1537\" tabindex=\"0\" hidden=\"hidden\"><ul><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L. Amorosi, J.Puerto, C. Valverde. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>An extended model of coordination of an all-terrain vehicle and a multivisit drone. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> International Transactions in Operational Research 10.1111. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.09 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> G. Erdogan, M. Battarra, A. M. Rodri\u0301guez-Chi\u0301a <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> The Hub Location and Pricing Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research, 301(3):1035-1047 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Baldomero-Naranjo. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Estudio de problemas de clasificaci\u00f3n supervisada y de localizaci\u00f3n en redes mediante optimizaci\u00f3n matem\u00e1tica. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> BEIO, Bolet\u00edn de Estad\u00edstica e Investigaci\u00f3n Operativa, 38, 2. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022\u00a0<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Bouzaine A., Mun\u0303oz-Ocan\u0303a. J.M., Rodri\u0301guez-Chia A.M., Hungri\u0301a A.B., Calvino J.J., Lo\u0301pez- Haro M. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Quantitative Evaluation of Supported Catalysts Key Properties from Electron Tomography Studies: Assessing Accuracy Using Material-realistic 3D- Models. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Topics in Catalysis, 65:859-870 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.80 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> S. Benati, J. Puerto, A. M. Rodri\u0301guez-Chi\u0301a, F. Temprano <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> A Mathematical Programming approach to Overlapping community detection. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Physica A: Statistical Mechanics and its Applications, 602, 127628 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>3.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> I. Espejo, R. Pa\u0301ez, J. Puerto, A.M. Rodri\u0301guez-Chi\u0301a <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Minimum Cost b-Matching Problems with Neighborhoods. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Computational Optimization and Applications, 83:525-553 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.60 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Jap\u00f3n, A. &amp; Puerto, J. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> A mathematical programming approach to SVM-based classification with label noise. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Industrial Engineering 172, 108611\u00a0 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.94 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Baldomero-Naranjo, J. Kalcsics, and A.M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Upgrading Location Problems with Edge Length Variations on Networks. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research <\/i><\/span><span style=\"font-family: NewsGotT, serif;\"><span lang=\"es-ES\"><a href=\"https:\/\/doi.org\/10.1016\/j.ejor.2022.02.001\">https:\/\/doi.org\/10.1016\/j.ejor.2022.02.001<\/a> <\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><i> <\/i><span style=\"font-family: NewsGotT, serif;\"><span lang=\"es-ES\">6.02 <\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>V. Blanco, G. Gonz\u00e1lez, Y. Hinojosa, D. Ponce, M. A. Pozo, and J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Network Flow based approaches for the Pipelines Routing Problem in Naval Design <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Omega (2022) <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 7.55 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>S. Benati, D. Ponce, J. Puerto, and A. M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> A branch-and-price procedure for clustering data that are graph connected. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>European Journal of Operational Research 297: 817\u2013830. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Puerto-Albandoz, Justo; Ricca, Federica; Rodr\u00edguez-Madrena, Mois\u00e9s; Scozzari, Andrea. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>A combinatorial optimization approach to scenario filtering in portfolio selection. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Computers &amp; Operations Research, VOL 142 105701. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 4.85 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Alfredo Mar\u00edn; Luisa I. Mart\u00ednez-Merino; Justo Puerto; Antonio M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> The soft-margin Support Vector Machine with ordered weighted average Knowledge-Based Systems. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Knowledge-Based Systems vol 237 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 9.42 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Huerta-Mu\u00f1oz, D.L, Archetti, C., Fern\u00e1ndez E., Perea, F. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> The Heterogeneous Flexible Periodic Vehicle Routing Problem: Mathematical formulations and solution algorithms. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research 141. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 4.85 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L. Amorosi, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Two-phase strategies for the bi-objective minimum spanning tree problem. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Operational Research. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2.410 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> J. Calvi\u00f1o, M. Lopez-Haro, J.M. Mu\u00f1oz-Oca\u00f1a, J. Puerto, A.M.Rodriguez-Chia. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Segmentation of Scanning-Transmission Electron Microscopy Images using the Ordered Median Problem. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> EJOR <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Marta Baldomero-Naranjo, Joerg Kalcsics, Alfredo Mar\u00edn, Antonio M. Rodr\u00edguez-Ch\u00eda. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Upgrading edges in the Maximal Covering Location Problem. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Jap\u00f3n, A., Puerto, J. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Robust optimal classification trees under noisy labels. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Advances in Data Analysis and Classification. 16, 155-179. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2.06 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Puerto, J. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> On hub location problems in geographically flexible networks. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> International Transactions in Operations Research 29(4), 2226-2249. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 3.75 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Benati S., Conde E. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>T\u00edtulo: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>A relative robust approach on expected returns with bounded CVaR for portfolio selection. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, vol. 296, p. 332-352 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2022 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Q1<\/i><\/span><\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1538\" aria-expanded=\"false\">2023<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1538\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1538\" tabindex=\"0\" hidden=\"hidden\"><ul><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, R. G\u00e1zquez, F. Saldanha-da Gama. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Multi-type maximal covering location problems: Hybridizing discrete and continuous problems. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research, 307(3):1040\u20131054. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, R. G\u00e1zquez. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Fairness in maximal covering location problems. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Operations Research, 157:106287. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, E. Fern\u00e1ndez, and Y. Hinojosa. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Hub Location with Protection Under Interhub Link Failures.\u00a0<\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> INFORMS Journal on Computing, 35, 5. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.30 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Labb\u00e9; M. Landete; M. Leal. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Dendrograms, minimum spanning trees and feature<br \/>selection. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research, 308, 2, 555-567. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, R. G\u00e1zquez, M. Leal. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Mathematical optimization models for reallocating and sharing<br \/>health equipment in pandemic situations. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Top, 31, 2, 355-390. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.50 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L. Amorosi, T. Padellini, J. Puerto, C. Valverde. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A Mathematical Programming Approach to Sparse Canonical Correlation Analysis. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Expert Systems with Applications ESWA&#8211;121293. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>9.29 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, A. Jap\u00f3n, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Multiclass Optimal Classification Trees with SVM-splits. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Machine Learning. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.30 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L. Guardiola, A. Meca, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Allocating the surplus induced by cooperation in distribution chains with multiple suppliers and retailers. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Journal of Mathematical Economics. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.00 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> E. Fern\u00e1ndez, Isabella Lari, J. Puerto, F. Ricca, A. Scozzari. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Connected graph partitioning with aggregated and non-aggregated gap objective functions. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Networks. 2023;1-20. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.45 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M.A. Pozo, J. Puerto, I. Rold\u00e1n. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>The biobjective minimum-cost Perfect Matching Problem and Chinese Postman Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> International Transactions in Operational Research. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>3.75 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L. Amorosi, J. Puerto, C. Valverde. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A\u00a0multiple-drone arc routing and mothership coordination problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research Volume 159, 106322. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> S. Benati, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>A Network Model for Multiple Selection Questions in Opinion Surveys. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Quality &amp; Quantity 58 (2), 1163-1179. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.48 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Y. Hinojosa, A. Mar\u00edn, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Dynamically second-preferred p-center problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research, 307-1, 33-47. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> L.I. Mart\u00ednez-Merino, D. Ponce, and J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Constraint relaxation for the Discrete Ordered Median Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Top 31: 538-561. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.50 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, G. Gonz\u00e1lez, Y. Hinojosa, D. Ponce, M. A. Pozo, and J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> The Pipelines and Cable Trays Location Problem in Naval Design <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Ocean Engineering 286: 115525.\u00a0<\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>5.15 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, R. G\u00e1zquez, D. Ponce, and J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> A Branch-and-Price approach for the Continuous Multifacility Monotone Ordered Median Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research ,306, 105-126 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> I. Espejo, R. Pa\u0301ez, J. Puerto, A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Facility location problems on graphs with non-convex neighborhoods. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Operations Research 159 (2023) 106356. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> B. Coben\u0303a, I. Contreras, L.I. Marti\u0301nez-Merino, A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> The profit- oriented hub line location problem with elastic demand. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research, 159, 106335 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> J.J. Calvino, E. Ferna\u0301ndez, M.Lo\u0301pez-Haro, J.M. Mun\u0303oz-Ocan\u0303a, A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Using the l1-norm for Image-based Tomographic Reconstruction. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Expert Systems With Applications, 232, 120848 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>9.29 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> I. Espejo, A. Mari\u0301n, J.M. Mun\u0303oz-Ocan\u0303a, A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> A new formulation and branch-and-cut method for single-allocation hub location problems. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research, 155, 106241 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> S. Benati, J. Puerto, A. M. Rodri\u0301guez-Chi\u0301a, F. Temprano <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Overlapping communities detection through weighted graph community games <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> PLOS ONE, 18(4), e0283857 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2023 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>3.11 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"9\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1539\" aria-expanded=\"false\">2024<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1539\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1539\" tabindex=\"0\" hidden=\"hidden\"><ul><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Dom\u00ednguez, C., G\u00e1zquez, R., Morales, J. M., Pineda, S. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i><em>The Cooperative Maximal Covering Location Problem with ordered partial attractions.<\/em>\u00a0<\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Operations Research, 170, 106782. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> P. Gagrani, V. Blanco, E. Smith, D. Baum. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i><em>Polyhedral geometry and combinatorics of an autocatalytic ecosystem<\/em>. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Journal of Mathematical Chemistry 62 (5), 1012-1078. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>1.70 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q2<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V. Blanco, Y. Hinojosa, V. Zavala. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i><em>The Waste-to-Biomethane Logistic Problem: A Mathematical Optimization Approach<\/em>. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> ACS Sustainable Chemistry &amp; Engineering 12(22). <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Mart\u00ednez-Ant\u00f3n, M. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i><em>On minimal extended representations of generalized power cones<\/em>. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> SIAM Journal on Optimization, 34(3), 3088-3111. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.95 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Blanco, V., Mart\u00ednez-Ant\u00f3n, M. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i><em>Optimal coverage-based placement of static leak detection devices for pipeline water supply networks<\/em>. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Omega, 122, 102956. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.55 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> J. Puerto, C. Valverde. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>The Hampered K-Median Problem with Neighbourhoods. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research, 170, 106786. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M.A. Pozo, J. Puerto, A. Torrej\u00f3n. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>The Ordered Median Tree Location Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research. Volume 169, 106746. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> R. Hassin, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Pricing heterogeneous products to heterogeneous customers who buy sequentially. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Annals of Operations Research, 340, 863\u2013890. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.40 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> I. Ljubic, M.A. Pozo, J. Puerto, A. Torrej\u00f3n. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Benders Decomposition for the Discrete Ordered Median Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research 317, 3, Pages 858-874. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> J. Puerto, C. Valverde. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>The Hampered Travelling Salesman Problem with Neighbourhoods. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Industrial Engineering, 188, C. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.94 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> V Blanco, A. Mar\u00edn, J. Puerto. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Intra-facility equity in discrete and continuous p-facility location problems. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research 162, 106487. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> D. Ponce, J. Puerto, and F. Temprano. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo: <\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>Mixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> European Journal of Operational Research (2024) 316: 519-538. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>6.02 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Landete, J.M. Mun\u0303oz-Ocan\u0303a, A.M. Rodri\u0301guez-Chi\u0301a and F. Saldanha da Gama. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Uncapacitated single-allocation hub median location with edge upgrading: models and exact solution algorithms. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Transportation Research Part B, 187, 103034. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>5.80 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Baldomero, L.I. Marti\u0301nez-Merino, A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Multi-product maximal covering second-level facility location problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers &amp; Industrial Engineering, 189, 109961. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>7.94 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> J.M. Mun\u0303oz-Ocan\u0303a, J. Puerto, and A.M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> Improved heuristics for solving large scale Scanning Transmission Electron Microscopy image segmentation using the ordered median problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Computers and Operations Research, 163, 106524. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>4.10 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1<\/i><\/span><\/li><li><b><span style=\"font-family: NewsGotT, serif;\"><i>Autores:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> M. Baldomero, Joerg Kalcsics, A. M. Rodri\u0301guez-Chi\u0301a. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i>T\u00edtulo:<\/i><\/span><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><span lang=\"en-US\"><i> On the complexity of the upgrading version of the Maximal Covering Location Problem. <\/i><\/span><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Referencia de la publicaci\u00f3n:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> Networks, 83(4):627-641. <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>A\u00f1o:<\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i> 2024 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Factor de impacto de la publicaci\u00f3n: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>2.45 <\/i><\/span><b><span style=\"font-family: NewsGotT, serif;\"><i>Cuartil: <\/i><\/span><\/b><span style=\"font-family: NewsGotT, serif;\"><i>Q1.<\/i><\/span><\/li><\/ul><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-4ab99bb elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"4ab99bb\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-47dc06e\" data-id=\"47dc06e\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-e7926fa elementor-widget elementor-widget-spacer\" data-id=\"e7926fa\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-dc0e495 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"dc0e495\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-bdb9e1e\" data-id=\"bdb9e1e\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-36405b1 elementor-widget elementor-widget-heading\" data-id=\"36405b1\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\">Congresos y conferencias<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-686fdaf elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"686fdaf\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-6db7040\" data-id=\"6db7040\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-8e6d0dd elementor-tabs-view-horizontal elementor-widget elementor-widget-tabs\" data-id=\"8e6d0dd\" data-element_type=\"widget\" data-widget_type=\"tabs.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-tabs\">\n\t\t\t<div class=\"elementor-tabs-wrapper\" role=\"tablist\" >\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1491\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-1491\" aria-expanded=\"false\"><a href=\"\">2016<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1492\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1492\" aria-expanded=\"false\"><a href=\"\">2017<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1493\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1493\" aria-expanded=\"false\"><a href=\"\">2018<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1494\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1494\" aria-expanded=\"false\"><a href=\"\">2019<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1495\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1495\" aria-expanded=\"false\"><a href=\"\">2020<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1496\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1496\" aria-expanded=\"false\"><a href=\"\">2021<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1497\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1497\" aria-expanded=\"false\"><a href=\"\">2022<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1498\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1498\" aria-expanded=\"false\"><a href=\"\">2023<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-1499\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"9\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1499\" aria-expanded=\"false\"><a href=\"\">2024<\/a><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t\t<div class=\"elementor-tabs-content-wrapper\" role=\"tablist\" aria-orientation=\"vertical\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-1491\" aria-expanded=\"false\">2016<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1491\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1491\" tabindex=\"0\" hidden=\"false\"><ul><li>Perea, F. MIP models for the scheduling of unrelated parallel machines with sequence dependent setup times and a scarce resource. XXXVI Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa. Toledo (Espa\u00f1a) (SEIO 2016).<\/li><li>Perea, F., Ruiz, R. Optimizing makespan and resource usage in parallel machine scheduling problems. 15th International Conference on Project Management and Scheduling. Valencia (Espa\u00f1a) (PMS 2016)<\/li><li>Perea, F. MIP models for the scheduling of unrelated parallel machines with sequence dependent setup times and a scarce resource. XXXVI Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa. Toledo (Espa\u00f1a) (SEIO 2016).<\/li><li>Perea, F., Ruiz, R. Optimizing makespan and resource usage in parallel machine scheduling problems. 15th International Conference on Project Management and Scheduling. Valencia (Espa\u00f1a) (PMS 2016)<\/li><li>V\u00edctor Blanco. Facility Locational Uncertainty in Discrete Ordered p-Median Problems. Seminar on Optimization, Sevilla, December 2016.<\/li><li>V\u00edctor Blanco. On minimum spanning trees with norm-based neighborhoods. XVIII CLAIO. Santiago de Chile, October, 2016.<\/li><li>V\u00edctor Blanco. A mathematical programming model for line planning in subway networks. XVIII CLAIO. Santiago de Chile, October, 2016.<\/li><li>V\u00edctor Blanco. Inverse-friendly Multiobjective Programs. Seminario Desafios de la Matem\u00e1tica combinatoria. Antequera, April 2016.<\/li><li>The DOMP revisited: new formulations, properties and algorithms. GOM seminar (Universite libre de Bruxelles). Brussels, October 13, 2016.<\/li><li>Set formulations for the Monotone Ordered Median Problem. XXIII EURO Working Group on Locational Analysis. VII International Workshop on Locational Analysis and Related Problems. Malaga, September 14-16, 2016 Coauthors: M. Labbe and J. Puerto.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1492\" aria-expanded=\"false\">2017<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1492\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1492\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Perea, F., Fanjul-Peyro, L., Ruiz, R. Algorithms for unrelated parallel machine scheduling with setups. Congreso de la Real Sociedad Matem\u00e1tica Espa\u00f1ola (RSME 2017). 03\/02\/2017<\/li><li>Perea, F., Puerto, J. Finding the nucleolus of any n-person cooperative game by a single linear program. IMA and OR Society Conference on Mathematics of Operational Research 21\/04\/2017. Birmingham (UK).<\/li><li>T\u00edtulo del trabajo: Some novel approaches to portfolio optimization<br \/>Nombre del congreso: 1ST SPANISH YOUNG STATISTICIANS AND OPERATIONAL RESEARCHERS MEETING<br \/>Ciudad de celebraci\u00f3n: Granada, Espa\u00f1a<br \/>Fecha de celebraci\u00f3n: 13\/11\/2017<br \/>Fecha de finalizaci\u00f3n: 15\/11\/2017<br \/>Entidad organizadora: SEIO, IEMATH-GR, EURO, UNIVERSIDAD DE GRANADA<br \/>Marina Leal Palaz\u00f3n; Diego Ponce L\u00f3pez; Justo Puerto Albandoz.<\/li><li>V\u00edctor Blanco. Clustering and Classification: A mathematical programming approach. RSME-UMA 2017. Buenos Aires (Argentina), December 2017.<br \/>V\u00edctor Blanco. Locating separating hyperplanes with LP-norms margins. Conference on Optimization Methods and Software. La Habana (Cuba), December 2017.<\/li><li>V\u00edctor Blanco. Some models for locational inexactness in combinatorial optimization. Jornadas Programa Doctorado Matem\u00e1ticas, Universidad de C\u00e1diz. Puerto Real, December 2017.<\/li><li>V\u00edctor Blanco. On the location of separating hyperplanes with LP norms margins. VIII International Workshop on Locational Analysis and Related Problems. Segovia, September 2017.<\/li><li>V\u00edctor Blanco. Locating hyperplanes to fitting set of points. 21st IFORS. Quebec City, July 2017.<\/li><li>V\u00edctor Blanco. Discrete Ordered Median Problems with Neighborhoods. ISOLDE XIV. Toronto\/Huntsville, July 2017.<\/li><li>V\u00edctor Blanco. Locational Uncertainty in some Combinatorial Optimization Problems, VI IBERO-AMERICAN CONGRESS ON OPERATIONS RESEARCH AND MANAGEMENT SCIENCES (IOCA 2017), Barranquilla , Colombia, March 2017.<\/li><li>V\u00edctor Blanco. Minimum spanning trees with Neighborhoods, Congreso RSME 2017. Zaragoza, February 2017.<\/li><li>Branch&amp;Price approaches for the Discrete Ordered Median Problem. SYSORM 2017. Granada, November 13-15, 2017. Coauthors: S. Deleplanque, M. Labbe and J. Puerto.<\/li><li>Approval Voting Problem under the k-centrum criterion. VIII International Work-shop on Locational Analysis and Related Problems. Segovia, September 27-29, 2017. Coauthors: J. Puerto, F. Ricca and A. Scozzari.<\/li><li>Formulations for the Discrete Ordered Median Problem with novel features. IFORS 2017. Quebec City, July 16-21, 2017. Coauthors: A. Marn and J. Puerto.<\/li><li>Branch&amp;Price approaches for the Monotone Ordered Median Problem. ISOLDE 2017. Toronto and Muskoka, July 9-14, 2017. Coauthors: M. Labbe and J. Puerto.<\/li><li>A GRASP heuristic for the Discrete Ordered Median Problem: how to exploit it into an exact method. ORBEL31. Brussels, February 2-3, 2017. Coauthors: S. Deleplanque, M. Labbe and J. Puerto.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1493\" aria-expanded=\"false\">2018<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1493\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1493\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u00ab7th edition of the Winter School on Network Optimization\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s. Estoril, PORTUGAL. 2018<br \/>\u00abConservative approach to location allocation problema for dimensional facilities\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, XXIV EURO Working Group on Locational Analysis. Edimburgo (Reino Unido), 2018<br \/>\u00abA discretization result for some optimization problems in framework spaces with polyhedral obstacles and the Manhattan metric\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, Discrete Mathematics Days 2018. Sevilla, 2018<\/li><li>T\u00edtulo del trabajo: A time-dependent version of the robust TSP and SPP<br \/>Nombre del congreso: International Symposium in Mathematical Programming<br \/>Ciudad de celebraci\u00f3n: Bordeaux, Francia<br \/>Fecha de celebraci\u00f3n: 01\/07\/2018<br \/>Fecha de finalizaci\u00f3n: 06\/07\/2018<br \/>Entidad organizadora: Mathematical Programming<br \/>Eduardo Conde S\u00e1nchez; Marina Leal Palaz\u00f3n; Justo Puerto Albandoz.<\/li><li>T\u00edtulo del trabajo: MINLP for pricing transaction costs in different models of portfolio selection<br \/>Nombre del congreso: International Symposium in Mathematical Programming<br \/>Ciudad de celebraci\u00f3n: Bordeaux, Francia<br \/>Fecha de celebraci\u00f3n: 01\/07\/2018<br \/>Fecha de finalizaci\u00f3n: 06\/07\/2018<br \/>Marina Leal Palaz\u00f3n; Diego Ponce L\u00f3pez; Justo Puerto Albandoz.<\/li><li>T\u00edtulo del trabajo: A novel bilevel portfolio selection problem<br \/>Nombre del congreso: 2nd International workshop on Bilevel Programming<br \/>Ciudad de celebraci\u00f3n: Lille, Francia<br \/>Fecha de celebraci\u00f3n: 18\/06\/2018<br \/>Fecha de finalizaci\u00f3n: 22\/06\/2018<br \/>Entidad organizadora: INRIA<br \/>Marina Leal Palaz\u00f3n; Diego Ponce L\u00f3pez; Justo Puerto Albandoz.<\/li><li>T\u00edtulo del trabajo: A novel bilevel location model<br \/>Nombre del congreso: XXIV EURO working group on locational analysis meeting<br \/>Ciudad de celebraci\u00f3n: Edinburgh,<br \/>Fecha de celebraci\u00f3n: 23\/05\/2018<br \/>Fecha de finalizaci\u00f3n: 25\/05\/2018<br \/>Entidad organizadora: EURO working group on locational analysis<br \/>Martine Labb\u00e9; Marina Leal Palaz\u00f3n; Justo Puerto Albandoz.<\/li><li>13th International Conference on Ordered Statistical Data OSD 2018. C\u00e1diz, 2018.<\/li><li>Yepes, J., Villa, F., Perea, F. Heur\u00edsticas para un problema de secuenciaci\u00f3n de m\u00e1quinas paralelas con necesidad de recursos en los ajustes. XXXVII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa (SEIO 2018). XI Jornadas de Estad\u00edstica P\u00fablica 01\/06\/2018<\/li><li>Perea, F., Menezes, M., Mesa, J.A. Discussion on computational complexity of railway network design problems. XXXVII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa (SEIO 2018). XI Jornadas de Estad\u00edstica P\u00fablica. 01\/06\/2018<\/li><li>Perea, F., Ruiz, R, Fanjul, L. Mathematical models and an exact algorithm for the heterogeneous vehicle routing problem. 29th European Conference on Operational Research (EURO 2018). 11\/07\/2018<\/li><li>Fanjul, L, Ruiz, R., Perea, F. Scheduling with additional resources in the setups. 29th European Conference on Operational Research (EURO 2018). 11\/07\/2018<\/li><li>V\u00edctor Blanco. Duality and multidimensional kernels in l_p-Support Vector Machines. ISMP 2018. Bordeaux, France, July 2018.<\/li><li>V\u00edctor Blanco. Upgrading nodes in tree-shaped hub location. SEIO 2018, Oviedo, Spain. May 2018.<\/li><li>Quasimonotone Discrete Ordered Median Problem. EWGLA 2018. Edinburgh, May 23-25, 2018. Coauthors: A. Marn and J. Puerto.<\/li><li>Mathematical programming formulations for the ecient solution of the k-sum approval voting problem. JOPT 2018. Montreal, May 7-9, 2018. Coauthors: J. Puerto, F. Ricca and A. Scozzari.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1494\" aria-expanded=\"false\">2019<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1494\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1494\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u201cLocating Hyperplanes for Multiclass Classification\u201d. <br \/>IX INTERNATIONAL WORKSHOP ON LOCATIONAL ANALYSIS AND RELATED PROBLEMS. C\u00e1diz, Spain. January, 2019.<\/li><li>\u201cSupport Vector Machine for Multiclass Classification\u201d. <br \/>PhD Seminar. Instituto de Matem\u00e1ticas de la universidad de Sevilla (IMUS). Seville, Spain. January, 2019.<\/li><li>\u201cPerturbed data Support Vector Machines\u201d. <br \/>MTM2016-74983-C02 \u2013 Research Project Meeting. C\u00e1diz, Spain. March, 2019.<\/li><li>\u201cA new approach to Multiclass Support Vector Machines\u201d.<br \/>1st EUROYoung Workshop. Seville, Spain. May, 2019.<\/li><li>\u00abOn location-allocation problems for dimensional facilities\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, IX International Workshop on Locational Analysis and Related Problems. C\u00e1diz, 2019<br \/>\u00abHow to apply Location Theory on the Portfolio Optimization problem\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, 2nd Spanish Young Statisticians and Operational Researchers Meeting (SYSORM). San Lorenzo del Escorial (Madrid), 2019<\/li><li>\u00abThe Obstacle-Avoiding Rectilinear-Link Steiner Minimum Tree Problem: applications to the design of transportation networks\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, XXXVIII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa y XII Jornadas de Estad\u00edsticas P\u00fablicas. Alcoi (Alicante), 2019<\/li><li>T\u00edtulo del trabajo: A minmax regret approach for a time-dependent version of the Traveling Salesman and Shortest Path Problems<br \/>Nombre del congreso: XXXVIII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa y las XII Jornadas de Estad\u00edstica P\u00fablica<br \/>Ciudad de celebraci\u00f3n: Alcoy, Espa\u00f1a<br \/>Fecha de celebraci\u00f3n: 03\/09\/2019<br \/>Fecha de finalizaci\u00f3n: 06\/09\/2019<br \/>Eduardo Conde S\u00e1nchez; Marina Leal Palaz\u00f3n; Justo Puerto Albandoz.<\/li><li>T\u00edtulo del trabajo: Contributions to robust and bilevel optimization models for decision-making<br \/>Nombre del congreso: XXXVIII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa y las XII Jornadas de Estad\u00edstica P\u00fablica<br \/>Ciudad de celebraci\u00f3n: Alcoy, Espa\u00f1a<br \/>Fecha de celebraci\u00f3n: 03\/09\/2019<br \/>Fecha de finalizaci\u00f3n: 06\/09\/2019<br \/>Eduardo Conde S\u00e1nchez; Marina Leal Palaz\u00f3n; Justo Puerto Albandoz<\/li><li>T\u00edtulo del trabajo: Portfolio optimization with two levels of decision-makers<br \/>Nombre del congreso: 30th European Conference on Operational Research<br \/>Ciudad de celebraci\u00f3n: Dubl\u00edn, Irlanda<br \/>Fecha de celebraci\u00f3n: 23\/07\/2019<br \/>Fecha de finalizaci\u00f3n: 26\/07\/2019<br \/>Entidad organizadora: EURO (Association of European Operational Research Societies)<br \/>Marina Leal Palaz\u00f3n; Diego Ponce L\u00f3pez; Justo Puerto Albandoz.<\/li><li>T\u00edtulo del trabajo: Contributions to robust and bilevel optimization models for decision-making<br \/>Nombre del congreso: Research seminars of the Research Training Group on Algorithmic Optimization(ALOP)<br \/>Ciudad de celebraci\u00f3n: Trier, Alemania<br \/>Fecha de celebraci\u00f3n: 09\/07\/2019<br \/>Marina Leal Palaz\u00f3n<\/li><li>Capacitated discrete ordered median problem. Jornada cient\u00edfica IMUS-UCA. Sevilla, 27 de Junio de 2019.<\/li><li>Capacitated Discrete Ordered Median Problems. IX Workshop on Locational Analysis and Related Problems 2019, January 30-February 1, C\u00e1diz, 2019<\/li><li>IX Workshop on Locational Analysis and Related Problems. C\u00e1diz, 2019.<\/li><li>Perea, F. Exact methods for hard problems. The first EUROYoung Workshop. Plenary talk. 2-3\/5\/2019.<\/li><li>Perea, F, Fanjul, L, Ruiz, R. Modelos matem\u00e1ticos para el VRP con flota heterog\u00e9nea. XXXVIII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa (SEIO 3-6\/9\/2019).<\/li><li>Perea, F., Puerto, J. Sobre el nucleolo de juegos cooperativos con muchos jugadores. XXXVIII Congreso Nacional de Estad\u00edstica e Investigaci\u00f3n Operativa (SEIO 3-6\/9\/2019).<\/li><li>Congreso: The First EUROYoung Workshop<br \/>Lugar y fecha: Instituto de Matem\u00e1ticas de la Universidad de Sevilla, 02\/05\/2019<\/li><li>Congreso: Workshop of the EURO Working Group on Vehicle Routing and Logistics optimization (VeRoLog)<br \/>Lugar y fecha: Fundaci\u00f3n Cajasol, Sevilla, 02\/06\/2019<\/li><li>An optimization model for line planning and timetabling in automated urban metro subway networks. A case study. Yolanda Hinojosa. Conferencia en las V Jornadas Doctorales de Programa de Doctorado en Matem\u00e1ticas. Universidad de C\u00e1diz, Noviembre 2019.<\/li><li>V\u00edctor Blanco. New Integer Programming Formulations for Maximum Covering with Ellipses. Congreso Estad\u00edstica e IO 2019, Alcoy, Spain, 2019.<\/li><li>V\u00edctor Blanco. Un viaje desde la localizaci\u00f3n al an\u00e1lisis de datos. Encuentro Nacional de Estudiantes de Matem\u00e1ticas ENEM. Granada, 2019. Youtube<\/li><li>V\u00edctor Blanco. Minimum Enclosing Polyellipses. IX International Workshop on Locational Analysis and Related Problems. C\u00e1diz. 2019.<\/li><li>V\u00edctor Blanco. Beyond disk-shaped continuous covering location problems. Seminario IMUS, Sevilla, November, 2019.<\/li><li>V\u00edctor Blanco. Planning and timetabling in automated subway networks, Seminario Teor\u00eda e Historia Econ\u00f3mica, October 2019.<\/li><li>V\u00edctor Blanco. Optimal Arrangements of Hyperplanes for Multiclass SVM-Based Classification, EURO 2019, Dublin, July 2019.<\/li><li>V\u00edctor Blanco. On hub location problems with neighborhoods, EWGLA 2019, Brussels, Belgium, June 2019.<\/li><li>Dynamic shipping in hierarchical freight transportation network. JOPT 2019. Montreal, May 13-15, 2019. Coauthors: I. Contreras y G. Laporte.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1495\" aria-expanded=\"false\">2020<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1495\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1495\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u201cExtensive facility location problems with hyperplanes\u201d. X INTERNATIONAL WORKSHOP ON LOCATIONAL ANALYSIS AND RELATED PROBLEMS. Seville, Spain. January, 2020.<\/li><li>\u00abAn application of the p-median problem in optimal portfolio selection\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, X International Workshop on Locational Analysis and Related Problems. Sevilla, 2020<\/li><li>T\u00edtulo del trabajo: On the applications of the trendy Benders Decomposition<br \/>Nombre del congreso: IMUS Virtual Seminar<br \/>Fecha de celebraci\u00f3n: 06\/11\/2020<br \/>Entidad organizadora: Instituto de Matem\u00e1ticas de la Universidad de Sevilla<br \/>Marina Leal Palaz\u00f3n<\/li><li>T\u00edtulo del trabajo: An introduction to benders decomposition<br \/>Nombre del congreso: Research seminars of the Research Training Group on Algorithmic Optimization<br \/>Tipo de participaci\u00f3n: Participativo &#8211; Plenaria<br \/>Ciudad de celebraci\u00f3n: Trier, Alemania<br \/>Fecha de celebraci\u00f3n: 12\/02\/2020<br \/>Entidad organizadora: Research Training Group on Algorithmic Optimization (ALOP)<br \/>Marina Leal Palaz\u00f3n<\/li><li>On some classes of combinatorial optimization problems with non-convex neighborhoods X Workshop on Locational Analysis and Related Problems 2019, January 23-24, Sevilla, 2020.<\/li><li>Upgraded network p-median problem. X Workshop on Locational Analysis and Related Problems 2019, January 23-24, Sevilla, 2020.<\/li><li>Congreso: X International Workshop on Locational Analysis and Related Problems<br \/>T\u00edtulo: XPP with Neighborhoods<br \/>Autores: Justo Puerto, Carlos Valverde<br \/>Lugar y fecha: Instituto de Matem\u00e1ticas de la Universidad de Sevilla, 23\/01\/2020<\/li><li>J.J. Calvino, E. F\u00e9rnandez, M. L\u00f3pez, J.M. Mu\u00f1oz, A.M. Rodr\u00edguez-Ch\u00eda. <br \/>Optimization Models Applied to Image Tomographic Reconstruction. Reuni\u00f3n de seguimiento del proyecto \u00abNetmeetData\u00bb Fundaci\u00f3n BBVA. Sevilla, 30 de Junio de 2020. <br \/>M. Baldomero-Naranjo, J. Kalcsics, and A.M. Rodr\u00edguez-Ch\u00eda Upgrading Location Problems with Edge Length Variations on Networks X Workshop on Locational Analysis and Related Problems 2019, January 23-24, Sevilla, 2020.<\/li><li>J.J. Calvino, M. L\u00f3pez-Haro, J. M. Mu\u00f1oz-Oca\u00f1a, and A.M. Rodr\u00edguez-Ch\u00eda. <br \/>Optimisation Models Applied to Image Reconstruction. <br \/>X Workshop on Locational Analysis and Related<br \/>Problems 2019, January 23-24, Sevilla, 2020.<\/li><li>I. Espejo,J. Puerto, and A.M. Rodr\u00edguez-Ch\u00eda. <br \/>On some classes of combinatorial optimization problems with non-convex neighborhoods X Workshop on Locational Analysis and Related<br \/>Problems 2019, January 23-24, Sevilla, 2020.<\/li><li>V\u00edctor Blanco. El problema de Weber y problemas de cubrimiento relacionados: polielipsoides. Seminario CIO. Youtube. 2020<\/li><li>V\u00edctor Blanco. Hub location problems with ball-shaped neighborhoods of varying radius. X International Workshop on Locational Analysis and Related Problems.Sevilla, 2020.<\/li><li>Dynamic shipping in hierarchical freight transportation network. X International Workshop on Locational Analysis and Related Problems. Sevilla, January 23-25, 2020. Coauthors: I. Contreras y G. Laporte.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1496\" aria-expanded=\"false\">2021<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1496\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1496\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Alberto Jap\u00f3n. \u201cLocalizando hiperplanos en el bosque\u201d. Complex Networks Meet Data Science Project Meeting. Seville, Spain. April, 2021.<\/li><li>Alberto Jap\u00f3n. \u201cComputer Vision &amp; Deep Learning\u201d. Seminar: Advances on data analysis, logistics and transportation problems on complex networks. Seville, Spain. December 2021.<\/li><li>\u00abThe Ordered Median Tree Location Problem\u00bb. Alberto Torrej\u00f3n Valenzuela. Seminario \u00abAdvances on data analysis, logistics and transportation problems on complex networks\u00bb, Instituto de Matem\u00e1ticas de la Universidad de Sevilla. 2021-12-21.<\/li><li>\u00abLocalizaci\u00f3n, conexi\u00f3n y orden en problemas de redes discretas\u00bb. Alberto Torrej\u00f3n Valenzuela. Seminario PhD, Instituto de Matem\u00e1ticas de la Universidad de Sevilla. 2022-03-10.<\/li><li>\u00abSingle-Facility Weber Location Problem with Different Norms at Different Regions\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, XV International Symposium on Locational Decisions and XXVI EURO Working Group on Locational Analysis. Wuppertal (Alemania &#8211; online), 2021<\/li><li>\u00abContinuous location in spaces with different lp-normed regions\u00bb, Rodr\u00edguez-Madrena,<\/li><li>Mois\u00e9s,18th Workshop on Advances in Continuous Optimization. Toulouse (Francia &#8211; online), 2021<\/li><li>\u00abNew advances in location problems and portfolio selection models\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, Advances on logistics and transportation problems on complex networks: Evaluation and conclusions. Fuengirola (M\u00e1laga), 2021<\/li><li>\u00abApplications, properties and curiosities of the WRP and related problems\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, Advances on data analysis, logistics and transportation problems on complex networks. Sevilla, 2021<\/li><li>T\u00edtulo del trabajo: Decisions, hierarchies, and uncertainty<br \/>Nombre del congreso: Premios Extraordinarios de Tesis<br \/>Entidad organizadora: Instituto de Matem\u00e1ticas de la Universidad de Sevilla<br \/>Fecha de celebraci\u00f3n: 21\/12\/2021<br \/>Marina Leal Palaz\u00f3n<\/li><li>T\u00edtulo del trabajo: On Continuous Reformulations for Binary-Constrained Mixed Complementarity Problems<br \/>Nombre del congreso: 31st European Conference on Operational Research (EURO 2021)<br \/>Ciudad de celebraci\u00f3n: Atenas, Grecia<br \/>Fecha de celebraci\u00f3n: 11\/07\/2021<br \/>Fecha de finalizaci\u00f3n: 14\/07\/2021<br \/>Steven A. Gabriel; Marina Leal Palaz\u00f3n; Martin Schmidt<\/li><li>T\u00edtulo del trabajo: Mixed Integer Linear and Nonlinear Programming for Bilevel, Uncertainty and Complementarity Problems<br \/>Nombre del congreso: Advances on logistics and transportation problems on complex networks:<br \/>Ciudad de celebraci\u00f3n: Fuengirola, Andaluc\u00eda, Espa\u00f1a<br \/>Fecha de celebraci\u00f3n: 23\/06\/2021<br \/>Fecha de finalizaci\u00f3n: 26\/06\/2021<br \/>Marina Leal Palaz\u00f3n<\/li><li>T\u00edtulo del trabajo: On the Benders Decomposition and Its Growing Popularity<br \/>Nombre del congreso: 2021 ICSO@IN3 Open Online Seminar<br \/>Ciudad de celebraci\u00f3n: Castelldefels (online), Catalu\u00f1a, Espa\u00f1a<br \/>Fecha de celebraci\u00f3n: 19\/01\/2021<br \/>Entidad organizadora: Universitat Oberta de Catalunya<br \/>Marina Leal Palaz\u00f3n.<\/li><li>Generalizations of the p-median problem. Advances on logistics and transportation problems on complex networks: Evaluation and conclusions, celebrado en Fuengirola, del 23 al 26 de junio, 2021.<\/li><li>Minimum cost b-matching problems with nonconvex neighborhoods. ISOLDE 21<\/li><li>Mejorando el rendimiento de MIPs con Gurobi. XIV Seminario de optimizaci\u00f3n de recursos y teor\u00eda de juegos. Murcia, 28 y 29 de Octubre de 2021.<\/li><li>Dynamically Second-Preferred p-Center Problem. Justo Puerto, Yolanda Hinojosa and Alfredo Mar\u00edn. ISOLDE XV (online). Germany 5-9 July 2021<\/li><li>Congreso: 15st International Symposium on Locational Decisions<br \/>Autores: Lavinia Amorosi, Justo Puerto, Carlos Valverde<br \/>T\u00edtulo: Extending Coordination Models: The Mothership and Drone Routing Problem with Graphs<br \/>Lugar y fecha: University of Wuppertal, 05\/07\/2021<\/li><li>Congreso: 31st European Conference on Operational Research<br \/>Autores: Justo Puerto, Carlos Valverde<br \/>T\u00edtulo: Routing for unmanned aerial vehicles: touring dimensional sets<br \/>Lugar y fecha: University of West Attica, 11\/07\/2021<\/li><li>A. Bouziane, J.M. Mu\u00f1oz-Oca\u00f1a, J. Grzonka, J. Marqueses-Rodr\u00edguez, A.B. Hungr\u00eda, A.M.<br \/>Rodr\u00edguez-Ch\u00eda, J.J. Calvino, M. L\u00f3pez-Haro. <br \/>Compressed Sensing Electron Tomography a Key Tool to Characterize Nanomaterials.<br \/>Microscopy at the Frontiers of Science, Braga, Portugal, 29 Septiembre al 1 Octubre 2021.<br \/>Organizaci\u00f3n: Sociedade Portuguesa de Microscopia, Sociedad de Microscop\u00eda de Espa\u00f1a. www.mfs2021.com<\/li><li>A. Mar\u00edn, L.I. Mart\u00ednez-Merino, J. Puerto, A. M. Rodr\u00edguez-Ch\u00eda.<br \/>Introducing the ordered weighted average in the soft-margin SVM. <br \/>31st European Conference on Operational Research (EURO 2021). <br \/>July 11-14, 2021. Athens.<\/li><li>J. J. Calvino, E. Fern\u00e1ndez, M. L\u00f3pez-Haro, J. M. Mu\u00f1oz-Oca\u00f1a, A. M. Rodr\u00edguez-Ch\u00eda.<br \/>Linear Optimization for Electron Tomography Reconstructions. <br \/>31st European Conference on Operational Research (EURO 2021). <br \/>July 11-14, 2021. Athens.<\/li><li>M. Baldomero-Naranjo, L.I. Mart\u00ednez-Merino, A. M. Rodr\u00edguez-Ch\u00eda. <br \/>A robust SVM-based approach with feature selection and outliers detection for classification problems. <br \/>31st European Conference on Operational Research (EURO 2021). <br \/>July 11-14, 2021. Athens.<\/li><li>I. Espejo, R. P\u00e1ez, J. Puerto, A.M. Rodr\u00edguez-Ch\u00eda. <br \/>Minimum cost b-matching problems with nonconvex neighborhoods.<br \/>ISOLDE XV CONFERENCE. International Symposium on Locational Decisions. <br \/>July 5-9, 2021, online.<\/li><li>J. J. Calvino, E. Fern\u00e1ndez, M. L\u00f3pez-Haro, J. M. Mu\u00f1oz-Oca\u00f1a, A. M. Rodr\u00edguez-Ch\u00eda.<br \/>ISOLDE XV CONFERENCE. <br \/>International Symposium on Locational Decisions. <br \/>l1-norm mathematical programming model applied to STEM tomography. <br \/>July 5-9, 2021, online.<\/li><li>M. Baldomero-Naranjo, J. Kalcsics, A. Mar\u00edn, A. M. Rodr\u00edguez-Ch\u00eda. <br \/>Upgrading Location Problems: An Approach using Integer Programming. <br \/>ISOLDE XV CONFERENCE. <br \/>International Symposium on Locational Decisions. <br \/>July 5-9, 2021, online.<\/li><li>Antonio M. Rodr\u00edguez-Ch\u00eda. <br \/>Generalizations of the discrete p-center problem. Advances on 20 logistics and transportation problems on complex networks: Evaluation and conclusions. <br \/>Fuengirola<br \/>23-26 June 2021<\/li><li>M. L\u00f3pez-Haro, O. Bazta, J. Marqueses-Rodr\u00edguez, R. Manzorro, J.M. Motes-Monroy, A.<br \/>Bouziane, A.B. Hungr\u00eda, S. Trasobares, J.A. P\u00e9rez-Omil, J.C. Hern\u00e1ndez-Garrido, L. Lajaune, L.E. Chinchilla, M. Castillo-Rodr\u00edguez, J. Grzonka, J.M. Mu\u00f1oz-Oca\u00f1a, A.M. Rodr\u00edguez-Ch\u00eda, C.E. Castillo, M.A. Cauqui, J.J. Calvino. <br \/>Microscop\u00eda Electr\u00f3nica para Cat\u00e1lisis Hoy. SECAT<br \/>18-20 Octubre 2021.<\/li><li>\u00abNew advances in community detection\u00bb. Francisco Temprano Garc\u00eda. Seminario \u00abAdvances on data analysis, logistics and transportation problems on complex networks\u00bb, Instituto de Matem\u00e1ticas de la Universidad de Sevilla. 2021-12-21.<\/li><li>\u00abOptimal Routing of Pipelines in Naval Designs\u00bb.<br \/>Gabriel Gonz\u00e1lez Dom\u00ednguez.<br \/>Seminario \u00abAdvances on data analysis, logistics and transportation problems on complex networks\u00bb, <br \/>Instituto de Matem\u00e1ticas de la Universidad de Sevilla. <br \/>2021-12-21.<\/li><li>V\u00edctor Blanco. Mathematical Optimization Models for Classification in Datasets with Noisy Labels. EURO 2021, Athens, Greece. July, 2021<\/li><li>V\u00edctor Blanco. Math Optimization approaches in Location Science, Machine Learning and Related Topics. Advances on logistics and transportation problems on complex networks: Evaluation and conclusions. Fuengirola, Malaga, Spain, 2021.<\/li><li>V\u00edctor Blanco. Location Analysis Meets Data Science. Machine Learning NeEDS Mathematical Optimization. Feb 15th, 2021. Youtube<\/li><li>2021: Workshop on \u201cAdvances on logistics and transportation problems on complex networks\u201d, Fuengirola [INVITED SPEAKER] \u201cHypothesis testing in the clique\/modularity partition problem\u201d<\/li><li>2021: CCS 2021: Conference on Complex Systems, Lyon, \u201cThe Marriage Game: New Insights from a Dynamic Model of Marriage, Domestic Labour, and Divorce\u201d<\/li><li>Clustering data that are graph connected. Seminario virtual IMUS: Ciclo Aplicaciones de la Optimizacion en el Instituto Andaluz de Matematicas. Sevilla, January 22, 2021. Coauthors: S. Benati, J. Puerto y A. M. Rodrguez-Cha.<\/li><li>Un sistema automatizado de rutado de canalizaciones basado en aprendizaje autom atico y programacion matematica (poster). Acto de clausura del Proyecto Singular CEI Andaluca Tech. Malaga, December 9, 2021. Coauthors: V. Blanco, G. Gonzalez, Y. Hinojosa, M. A. Pozo y J. Puerto.<\/li><li>Relajacion de restricciones en Optimizacion Discreta Mixta. XIV Seminario de Optimizacion de Recursos y Teora de Juegos. Murcia, October 29, 2021.<\/li><li>From the Discrete Ordered Median Problem to other combinatorial optimization problems. Advances on logistics and transportation problems on complex networks: Evaluation and conclusions. Fuengirola, June 24, 2021.<\/li><li>A Branch-and-price procedure for continuous multifacility location problems. Reunion de seguimiento del proyecto BBVA y MTM 2016. Sevilla, March 25. 2021. Coauthors: V. Blanco, R. Gazquez y. Puerto.<\/li><li>\u00abNew advances in community detection\u00bb. Francisco Temprano Garc\u00eda. Seminario \u00abAdvances on data analysis, logistics and transportation problems on complex networks\u00bb, Instituto de Matem\u00e1ticas de la Universidad de Sevilla. 2021-12-21.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1497\" aria-expanded=\"false\">2022<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1497\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1497\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u00abFairness in Maximal Covering Facility Location Problems.\u00bb, Ricardo G\u00e1zquez, EWGLA 2022. Aveiro (Portugal), 2022<\/li><li>\u00abMultitype Maximal Covering Location Problems: Hybridizing discrete and continuous problems.\u00bb, Ricardo G\u00e1zquez, SEIO 2022. Granada, 2022<\/li><li>\u00abA travel through location analysis and applications to machine learning.\u00bb, Victor Blanco Izquierdo, IBERO-AMERICAN SUMMER SCHOOL OF OPERATIONS RESEARCH (ELAVIO 2022), Monterrey (Mexico), 2022<\/li><li>\u00abOn the location of hydrosensors in urban networks to prevent water leaks.\u00bb, Miguel Mart\u00ednez Ant\u00f3n, IBERO-AMERICAN SUMMER SCHOOL OF OPERATIONS RESEARCH (ELAVIO 2022), Monterrey (Mexico), 2022<\/li><li>\u00abOptimizaci\u00f3n binivel: una introducci\u00f3n con aplicaciones actuales.\u00bb, Marina Leal Palaz\u00f3n, Seminario Departamento de Matem\u00e1ticas, Estad\u00edstica e Investigaci\u00f3n Operativa, San Crist\u00f3bal de la Laguna, 2022<\/li><li>\u00abFeature Selection, Dendrograms, and Minimum Spanning Trees.\u00bb, Marina Leal Palaz\u00f3n, EURO 2022, Helsinki (Finlandia), 2022<\/li><li>\u00abIncluding elastic demand in the hub line location problem.\u00bb, Luisa I. Mart\u00ednez Merino, EWGLA 2022. Aveiro (Portugal), 2022<\/li><li>\u00abConstraints Relaxation for the Discrete Ordered Median Problem.\u00bb, Luisa I. Mart\u00ednez Merino, SEIO 2022. Granada, 2022<\/li><li>\u00abMathematical Programming techniques for Scanning Transmission Electron Microscopy Image Segmentations.\u00bb, Juan Manuel Mu\u00f1oz Oca\u00f1a, SEIO 2022. Granada, 2022<\/li><li>\u00abNew formulations for single allocation hubs location problems.\u00bb, Inmaculada Espejo, SEIO 2022. Granada, 2022<\/li><li>\u00abOnline Optimization: theory and applications.\u00bb, Diego Ponce, Seminario Aplicaciones de la Optimizaci\u00f3n 2022. Sevilla, 2022<\/li><li>\u00abA branch-and-price for the continuous multifacility monotone ordered median problem.\u00bb, Diego Ponce, EWGLA 2022. Aveiro (Portugal), 2022<\/li><li>\u00abOptimal routing of pipelines in Naval Designs.\u00bb, Diego Ponce, SEIO 2022. Granada, 2022<\/li><li>\u00abPortfolio selection with scenario ltering: A combinatorial optimization approach\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, XXIII Workshop on Quantitative Finance. Roma (Italia), 2022<\/li><li>\u00abLocation Problems: New Advances and Applications\u00bb, Rodr\u00edguez-Madrena, Mois\u00e9s, Seminario impartido en el Department of Business Studies de la Roma Tre University. Roma (Italia), 2022<\/li><li>T\u00edtulo del trabajo: Living science<br \/>Nombre del congreso: Second Annual International Congress of Doctorate Students (II CAIED)<br \/>Entidad organizadora:Universidad Miguel Hern\u00e1ndez<br \/>Fecha de celebraci\u00f3n: 03\/02\/2022 &#8211; 04\/02\/2022<br \/>Marina Leal Palaz\u00f3n<\/li><li>T\u00edtulo del trabajo: Location, Regions and Preferences<br \/>Nombre del congreso: International Workshop on Locational Analysis and Related Problems 2022<br \/>Entidad organizadora:Grupos GELOCA y REDLOCA<br \/>Fecha de celebraci\u00f3n: 31\/01\/2022 &#8211; 01\/02\/2022<br \/>V\u00edctor Blanco, Ricardo G\u00e1zquez, Marina Leal Palaz\u00f3n<\/li><li>Optimizaci\u00f3n Matem\u00e1tica y Transferencia Tecnol\u00f3gica. Yolanda Hinojosa. Conferencia en el Seminario Matem\u00e1ticas Aplicadas a la Ciencia y la Empresa. Universidad de Granada, Marzo 2022<\/li><li>Hub Location Models with protection under failures. V\u00edctor Blanco, Elena Fern\u00e1ndez and Yolanda Hinojosa. International Conference 2021-2022 on applied combinatorial optimization. Chile, April 2022.<\/li><li>Maria Battarra, G\u00fcnes Erdo?gan, A.M. Rodr\u00edguez-Ch\u00eda. <br \/>Pricing in Hub Problems. <br \/>XII ENCUENTRO ANDALUZ DE MATEMATICA DISCRETA, Jerez de la Frontera (C\u00e1diz), 03 y 04 de febrero de 2022<\/li><li>J.J Calvino, M. L\u00f3pez-Haro, J.M. Mu\u00f1oz-Oca\u00f1a, A.M. Rodr\u00edguez-Ch\u00eda.<br \/>The discrete ordered median problem for clustering STEM-image intensities. <br \/>XI Workshop on Locational Analysis and Related Problems 2022, January 31-February 1, Elche, 2022.<\/li><li>M. Baldomero-Naranjo, J. Kalcsics, A. M. Rodr\u00edguez-Ch\u00eda<br \/>On the complexity of the upgrading version of the Maximal Covering Location Problem.<br \/>XI Workshop on Locational Analysis and Related Problems 2022,<br \/>January 31-February 1, Elche, 2022.<\/li><li>V\u00edctor Blanco. Fairness in Maximal Covering Location Problems. Xth Joint ALIO\/EURO International Conference on Applied Combinatorial Optimization. April 2022. Vi\u00f1a del Mar, Chile.<\/li><li>V\u00edctor Blanco. Hub Location Models with protection under failures. Xth Joint ALIO\/EURO International Conference on Applied Combinatorial Optimization. April 2022. Vi\u00f1a del Mar, Chile.<\/li><li>Universit\u00e0 di Milano Bicocca, 4 february, 2022 \u201cColumn generation for clique portioning connected data\u201d<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1498\" aria-expanded=\"false\">2023<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1498\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1498\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u00abContinuous single facility location with preferences in neighborhoods.\u00bb, Ricardo G\u00e1zquez, SEIO 2023, Elche, 2023<\/li><li>\u00abCapturing uncertainty in the Hybridized Maximal Covering Location Problem.\u00bb,\u00a0 Ricardo G\u00e1zquez, ISOLDE 2023. Kaiserslautern (Alemania), 2023<\/li><li>\u00abThe Waste-To-Biomethane Logistic Problem.\u00bb,\u00a0 Victor Blanco Izquierdo, IWOLOCA 2023. Edimburgo (Escocia), 2023<\/li><li>\u00abFairness in the Maximal Covering Location Problem.\u00bb,\u00a0 Victor Blanco Izquierdo, SIAM Optimization 2023, Seattle (EEUU), 2023<\/li><li>\u00abLocation Science meets Machine Learning: Mathematical (discrete) Optimization approaches for Data Science.\u00bb,\u00a0 Victor Blanco Izquierdo, SILO Seminar, University of Wisconsin-Madison, 2023<\/li><li>\u00abMath Opt \\&amp; Data Science: A Facility Location perspective to Supervised Learning.\u00bb,\u00a0 Victor Blanco Izquierdo, IS\\&amp;E Seminar, University of Lehigh, 2023<\/li><li>\u00abOptimal routing of pipelines trays in Naval Designs.\u00bb,\u00a0 Victor Blanco Izquierdo, Invited Seminar, Monterrey (M\u00e9xico), 2023<\/li><li>\u00abMinimal second order cone reformulation for SVM with Lp-norm.\u00bb,\u00a0 Miguel Mart\u00ednez Ant\u00f3n, DOC-COURSE ON DATA SCIENCE 2023 (DCDS 2023). Granada, 2023<\/li><li>\u00abCombinatorics of Extended Representations of generalized power cones.\u00bb,\u00a0 Miguel Mart\u00ednez Ant\u00f3n, IWOLOCA 2023. Edimburgo (Escocia), 2023<\/li><li>\u00abOptimal coverage-based placement of static leak detection devices for pipeline water supply networks.\u00bb,\u00a0 Miguel Mart\u00ednez Ant\u00f3n, ISOLDE 2023. Kaiserslautern (Alemania), 2023<\/li><li>\u00abSingle-allocation hub network design decision with upgrading.\u00bb, Juan Manuel Mu\u00f1oz Oca\u00f1a, ISOLDE 2023. Kaiserslautern (Alemania), 2023<\/li><li>\u00abIncomplete hub location networks with upgrading.\u00bb, Juan Manuel Mu\u00f1oz Oca\u00f1a, SEIO 2023, Elche, 2023<\/li><li>\u00abHeuristic segmentations in Electron Tomography using the DOMP.\u00bb, Juan Manuel Mu\u00f1oz Oca\u00f1a, IWOLOCA 2023. Edimburgo (Escocia), 2023<\/li><li>\u00abThe Induced Facility Location Problem with Upgrading.\u00bb, Inmaculada Espejo, IWOLOCA 2023. Edimburgo (Escocia), 2023<\/li><li>\u00abUpgrading arcs to p-median problem in a bi-network.\u00bb, Inmaculada Espejo, International Colloquium on Graphs and Optimization 2023. Spa (B\u00e9lgica), 2023<\/li><li>\u00abThe Pipelines and Cable Trays Location Problem in Naval Design.\u00bb, Gabriel Gonz\u00e1lez Dom\u00ednguez, IWOLOCA 2023, Edimburgo (Escocia) 2023<\/li><li>\u00abThe Storyboard Problem.\u00bb, Gabriel Gonz\u00e1lez Dom\u00ednguez, SEIO 2023, Elche 2023<\/li><li>\u00abModeling demand elasticity for the hub line location problem.\u00bb, Luisa I. Mart\u00ednez Merino, IFORS 2023, Santiago de Chile (Chile) 2023<\/li><li>\u00abConstraint Relaxation for the Discrete Ordered Median Problem.\u00bb, Diego Ponce, IFORS 2023, Santiago de Chile (Chile) 2023<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"9\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-1499\" aria-expanded=\"false\">2024<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-1499\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"9\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-1499\" tabindex=\"0\" hidden=\"hidden\"><ul><li>\u00abAn upgrading approach for the multi-type Maximal Covering Location Problem.\u00bb, Ricardo G\u00e1zquez, IWOLOCA 2024, Granada, 2024<\/li><li>\u00abOn the Incorporation of Regional Preferences in Continuous Location Problems.\u00bb, Ricardo G\u00e1zquez, EWGLA 2024, Sheffield (Inglaterra), 2024<\/li><li>\u00abOptimal location of mediated points and its implication for sums of squares.\u00bb, Miguel Mart\u00ednez Ant\u00f3n, EWGLA 2024, Sheffield (Inglaterra), 2024<\/li><li>\u00abGravitational Covering Location Problem.\u00bb, Miguel Mart\u00ednez Ant\u00f3n, Workshop on Resource Optimization 2024, C\u00e1diz, 2024<\/li><li>\u00abNew results about the stochastic single-allocation hub location problem.\u00bb, Inmaculada, ECCO XXXVII Conference 2024, Gante (B\u00e9lgica), 2024<\/li><li>\u00abDetecting communities via location analysis.\u00bb, Diego Ponce, Location Science Workshop, Madrid, 2024<\/li><li>\u00abMulti-product maximal covering second-level facility location<br \/>problem.\u00bb, Luisa I. Mart\u00ednez Merino, EURO 2024, Copenhagen (Dinamarca), 2024<\/li><li>\u00abMixed-integer linear programming formulations and column generation algorithms for the Minimum Normalized Cuts problem on networks.\u00bb, Diego Ponce, EURO 2024, Copenhagen (Dinamarca), 2024<\/li><li>\u00abExpanding Chemical Reaction Networks through growth maximizing autocatalytic subnetworks.\u00bb, Gabrield Gonz\u00e1lez Dom\u00ednguez, IWOLOCA 2024, Granada, 2024<\/li><li>\u00abFixed Topology Minimum-Cost Tree with Neighborhoods.\u00bb, Gabrield Gonz\u00e1lez Dom\u00ednguez, EWGLA 2024, Sheffield (Inglaterra), 2024<\/li><li>\u00ab\u00c1rbol de Steiner con topolog\u00eda prefijada.\u00bb, Gabrield Gonz\u00e1lez Dom\u00ednguez, Workshop on Resource Optimization 2024, C\u00e1diz, 2024<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-1b90357 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"1b90357\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-66348fe\" data-id=\"66348fe\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-d33469a elementor-widget elementor-widget-spacer\" data-id=\"d33469a\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<div class=\"elementor-element elementor-element-6856867 elementor-widget elementor-widget-heading\" data-id=\"6856867\" data-element_type=\"widget\" data-widget_type=\"heading.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t<h2 class=\"elementor-heading-title elementor-size-default\">Tesis, Tesinas, DEA, etc<\/h2>\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-2275443 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"2275443\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-c893cce\" data-id=\"c893cce\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-c47a026 elementor-tabs-view-horizontal elementor-widget elementor-widget-tabs\" data-id=\"c47a026\" data-element_type=\"widget\" data-widget_type=\"tabs.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-tabs\">\n\t\t\t<div class=\"elementor-tabs-wrapper\" role=\"tablist\" >\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2061\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-2061\" aria-expanded=\"false\"><a href=\"\">2016<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2062\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2062\" aria-expanded=\"false\"><a href=\"\">2017<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2063\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2063\" aria-expanded=\"false\"><a href=\"\">2018<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2064\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2064\" aria-expanded=\"false\"><a href=\"\">2019<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2065\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2065\" aria-expanded=\"false\"><a href=\"\">2020<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2066\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2066\" aria-expanded=\"false\"><a href=\"\">2021<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2067\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2067\" aria-expanded=\"false\"><a href=\"\">2022<\/a><\/div>\n\t\t\t\t\t\t\t\t\t<div id=\"elementor-tab-title-2068\" class=\"elementor-tab-title elementor-tab-desktop-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2068\" aria-expanded=\"false\"><a href=\"\">2023<\/a><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t\t<div class=\"elementor-tabs-content-wrapper\" role=\"tablist\" aria-orientation=\"vertical\">\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"true\" data-tab=\"1\" role=\"tab\" tabindex=\"0\" aria-controls=\"elementor-tab-content-2061\" aria-expanded=\"false\">2016<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2061\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"1\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2061\" tabindex=\"0\" hidden=\"false\"><ul><li>Proyecto fin de carrera: \u00abProgramaci\u00f3n lineal y entera mixta para la optimizaci\u00f3n del problema de cartera de valores\u00bb. Autor: Rodr\u00edguez-Madrena, Mois\u00e9s. Directores: Puerto-Albandoz, Justo. (2016)<\/li><li>Title: OPTIMIZATION OF THE CALIBRATION COSTS IN A LABORATORY ACREDITED BY ILAC<br \/>Date: 12\/09\/2016<br \/>Student: Stopi\u00f1a Dur\u00e1n, Mar\u00eda Jos\u00e9<br \/>Grade: Sobresaliente<br \/>Institution: Universitat Polit\u00e8cnica de Val\u00e8ncia<\/li><li>Title: OPTIMIZATION OF THE CALIBRATION COSTS IN A LABORATORY ACREDITED BY ILAC<br \/>Date: 12\/09\/2016<br \/>Student: Stopi\u00f1a Dur\u00e1n, Mar\u00eda Jos\u00e9<br \/>Grade: Sobresaliente<br \/>Institution: Universitat Polit\u00e8cnica de Val\u00e8ncia<\/li><li>Teor\u00eda de juegos no cooperativa: las matem\u00e1ticas de la competencia. Autor: Antonio L\u00f3pez. Director: Victor Blanco<\/li><li>Date: 12\/09\/2016<br \/>Student: Stopi\u00f1a Dur\u00e1n, Mar\u00eda Jos\u00e9<br \/>Grade: Sobresaliente<br \/>Institution: Universitat Polit\u00e8cnica de Val\u00e8ncia<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"2\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2062\" aria-expanded=\"false\">2017<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2062\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"2\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2062\" tabindex=\"0\" hidden=\"hidden\"><ul><li>T\u00edtulo: UNA METAHEUR\u00cdSTICA PARA UN PROBLEMA DE SECUENCIACI\u00d3N CON NECESIDAD DE RECURSOS EN LOS AJUSTES <br \/>Alumno: YEPES BORRERO, JUAN CAMILO <br \/>Calif.: Sobresaliente <br \/>Fecha: 18\/07\/17<br \/>Instituci\u00f3n: UPV<br \/>Co-Supervisors: Mar\u00eda Fulgencia Villa Juli\u00e1<\/li><li>T\u00edtulo: METAHEUR\u00cdSTICAS PARA EL DISE\u00d1O DE REDES DE FERROCARRIL EN COMPETENCIA CON MEDIO DE TRANSPORTE ALTERNATIVO<br \/>Alumno: RUBIO DEL REY, FERNANDO<br \/>Calif.: Sobresaliente<br \/>Fecha: 22\/09\/17<br \/>Instituaci\u00f3n: UPV<\/li><li>Tesis, Tesinas, DEA, etc:<br \/>Proyecto fin de grado: \u00ab\u00c1rbol de expansi\u00f3n con el m\u00e1ximo n\u00famero de hojas\u00bb. Autora: Ahumada Fuentes, Roxana. Directores: Rodr\u00edguez-Ch\u00eda, Antonio, Mart\u00ednez-Merino, Luisa Isabel. (2017)<br \/>Proyecto fin de m\u00e1ster: \u00abAvances en Support Vector Machine\u00bb. Autora: Baldomero Naranjo, Marta. Directores: Rodr\u00edguez-Ch\u00eda, Antonio, Mart\u00ednez-Merino, Luisa Isabel. (2017)<\/li><li>Tesina: \u00abProblema de localizaci\u00f3n con barreras\u00bb. Autor: Rodr\u00edguez-Madrena, Mois\u00e9s. Directores: Puerto-Albandoz, Justo. (2017)<\/li><li>T\u00edtulo: UNA METAHEUR\u00cdSTICA PARA UN PROBLEMA DE SECUENCIACI\u00d3N CON NECESIDAD DE RECURSOS EN LOS AJUSTES <br \/>Alumno: YEPES BORRERO, JUAN CAMILO <br \/>Calif.: Sobresaliente <br \/>Fecha: 18\/07\/17<br \/>Instituci\u00f3n: UPV<br \/>Co-Supervisors: Mar\u00eda Fulgencia Villa Juli\u00e1<\/li><li>T\u00edtulo: METAHEUR\u00cdSTICAS PARA EL DISE\u00d1O DE REDES DE FERROCARRIL EN COMPETENCIA CON MEDIO DE TRANSPORTE ALTERNATIVO<br \/>Alumno: RUBIO DEL REY, FERNANDO<br \/>Calif.: Sobresaliente<br \/>Fecha: 22\/09\/17<br \/>Instituaci\u00f3n: UPV<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"3\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2063\" aria-expanded=\"false\">2018<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2063\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"3\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2063\" tabindex=\"0\" hidden=\"hidden\"><ul><li>T\u00edtulo: Matheur\u00edsticas para el problema de secuenciaci\u00f3n de m\u00e1quinas paralelas con necesidad de recursos adicionales en los ajustes Alumno: ZHANG, LING\u00a0 Calif.:\u00a0\u00a0\u00a0 Notable<br \/>Fecha: 19\/09\/18\u00a0 Instituci\u00f3n: UPV<\/li><li>Modelo para la toma de decisiones de localizaci\u00f3n de hoteles. Autor: Bel\u00e9n B.R. (Trabajo Fin de M\u00e1ster). Director: Victor Blanco<\/li><li>An\u00e1lisis estad\u00edstico del impacto de los factores clim\u00e1ticos en la demanda tur\u00edstica en la estaci\u00f3n de esqu\u00ed Sierra Nevada. Autor: Stanislav D. (Trabajo Fin de M\u00e1ster). Director: Victor Blanco<\/li><li>Localizaci\u00f3n continua de concentradores. Autor: Carlos Fraguas. (Trabajo Fin de M\u00e1ster). Director: Victor Blanco<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"4\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2064\" aria-expanded=\"false\">2019<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2064\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"4\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2064\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Optimizaci\u00f3n en tratamientos de radioterapia mediante programaci\u00f3n multiobjetivo. Autora: Inmaculada Izquierdo Cruz. Tutora: Inmaculada Espejo Miranda (2019).<\/li><li>An\u00e1lisis de redes financieras. Autor. Ricardo G\u00e1zquez. (Trabajo Fin de M\u00e1ster). Director: Victor Blanco.<\/li><li>Proyecto de Construcci\u00f3n EDAR Santaella. Autor: Jes\u00fas Miguel Garc\u00eda. (Trabajo Fin de M\u00e1ster). Director: Victor<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"5\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2065\" aria-expanded=\"false\">2020<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2065\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"5\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2065\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Tesis:<br \/>Title: Secuenciaci\u00f3n de m\u00e1quinas con necesidad de ajustes y recursos adicionales.<br \/>Date: 25\/11\/2020<br \/>Student: Yepes Borrero, Juan Camilo<br \/>Grade: SOBRESALIENTE (cum laude)<br \/>Co-Supervisors: Mar\u00eda Fulgencia Villa Juli\u00e1<br \/>Institution: Universitat Polit\u00e8cnica de Val\u00e8ncia<\/li><li>Metaheur\u00edsticas constructivas para la secuenciaci\u00f3n de m\u00e1quinas en paralelo con ajustes entre trabajos y necesidad de recursos adicionales. <br \/>Alumno: LOPEZ ESTEVE, AXEL JAVIER <br \/>Calif.: Notable<br \/>Fecha: 21\/07\/20<br \/>Instituci\u00f3n: UPV<\/li><li>Proyecto de construcci\u00f3n de parque e\u00f3lico en el T.M. de San Roque. Autor: Patricia S\u00e1nchez. (Trabajo Fin de M\u00e1ster). Director: Victor Blanco.<\/li><li>Localizaci\u00f3n en redes de concentradores incompletas en ambiente continuo. Autor: David L\u00e1zaro Rodr\u00edguez. (Trabajo Fin de M\u00e1ster). Director: Victor<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"6\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2066\" aria-expanded=\"false\">2021<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2066\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"6\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2066\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Tfg<br \/>\u00c1. P\u00e9rez-Barriga, \u201cAn\u00e1lisis de las estad\u00edsticas de morbilidad y de defunciones seg\u00fan la causa de muerte en Espa\u00f1a.\u201d Universidad de Sevilla, 08\/07\/2021. Dirigido por Miguel Pozo<\/li><li>Tfg<br \/>M.Lucio-P\u00e9rez, \u201cUn an\u00e1lisis sobre el impacto econ\u00f3mico del Covid-19 en Espa\u00f1a durante el a\u00f1o 2020.\u201d Universidad de Sevilla, 14\/07\/2021. Dirigido por Miguel Pozo<\/li><li>TFG:<br \/>T\u00edtulo : Optimizaci\u00f3n de la secuenciaci\u00f3n de la producci\u00f3n en una empresa del sector de los aerosoles<br \/>Alumno: MARTINEZ SIO, ALBERTO<br \/>Calif.: Sobresaliente<br \/>Fecha : 22\/09\/21<br \/>Instituci\u00f3n: UPV<br \/>Supervisor: Federico Perea<br \/>Co-Supervisors: Vicent Giner Bosch<\/li><li>Direcci\u00f3n de Tesis doctoral:<br \/>T\u00edtulo: Supervised Classification and Network Location Problems via Mathematical Optimization<br \/>(Estudio de Problemas de Clasificaci\u00f3n Supervisada y de Localizaci\u00f3n en Redes<br \/>mediante Optimizaci\u00f3n Matem\u00e1tica)?. Menci\u00f3n Internacional.<br \/>Doctorando: Marta Baldomero Naranjo.<br \/>Universidad: Universidad de C\u00e1diz.<br \/>Facultad \/ Escuela: Facultad de Ciencias.<br \/>Fecha: 16-11-2021.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"7\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2067\" aria-expanded=\"false\">2022<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2067\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"7\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2067\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Direcci\u00f3n de Tesis doctoral:<br \/>T\u00edtulo: Advances and applications in continuous location and related problems. Menci\u00f3n Internacional.<br \/>Doctorando: Ricardo G\u00e1zquez Torres.<br \/>Universidad: Universidad de Granada.<br \/>Fecha: 30-05-2022\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Director: Victor Blanco Izquierdo.<\/li><li>Direcci\u00f3n de Tesis doctoral:<br \/>T\u00edtulo: New Advances In Data Science Problems Through Hyperplanes Location. Menci\u00f3n Internacional.<br \/>Doctorando: Alberto Jap\u00f3n S\u00e1ez.<br \/>Universidad: Universidad de Sevilla.<br \/>Facultad \/ Escuela: Departamento de Estad\u00edstica e Investigaci\u00f3n Operativa.<br \/>Fecha: 02-06-2022.\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Director: Victor Blanco Izquierdo, Justo Puerto Albandoz.<\/li><li>\u201cAn\u00e1lisis sobre la abstenci\u00f3n al voto en las elecciones para el Congreso de noviembre de 2019\u201d. Autor: Le\u00f3n-Valera, Pablo. Director: Jap\u00f3n, Alberto. Universidad Pablo de Olavide de Sevilla (2021)<\/li><li>\u201cLa opini\u00f3n de los ciudadanos y ciudadanas sobre los servicios p\u00fablicos en Espa\u00f1a\u201d. Autor: Fajardo-Cabello, Patricia. Director: Jap\u00f3n, Alberto. Universidad Pablo de Olavide de Sevilla (2021)<\/li><li>\u00abSelecci\u00f3n \u00d3ptima de Variables en An\u00e1lisis Cl\u00faster\u00bb. Autor: Silvia gonz\u00e1lez Galindo. Director: Victor Blanco. (Trabajo Fin de M\u00e1ster). 2022.<\/li><li>\u00ab\u201cHerramientas de Optimizaci\u00f3n Matem\u00e1tica para la<br \/>construcci\u00f3n de Herramientas Interpretables en Machine Learning\u00bb. Autor: Jos\u00e9 Damian \u00c1vila Bosquet. Director: Victor Blanco (Trabajo Fin de M\u00e1ster). 2022<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t\t\t<div class=\"elementor-tab-title elementor-tab-mobile-title\" aria-selected=\"false\" data-tab=\"8\" role=\"tab\" tabindex=\"-1\" aria-controls=\"elementor-tab-content-2068\" aria-expanded=\"false\">2023<\/div>\n\t\t\t\t\t<div id=\"elementor-tab-content-2068\" class=\"elementor-tab-content elementor-clearfix\" data-tab=\"8\" role=\"tabpanel\" aria-labelledby=\"elementor-tab-title-2068\" tabindex=\"0\" hidden=\"hidden\"><ul><li>Direcci\u00f3n de Tesis doctoral:<br \/>T\u00edtulo: Conic programming for routing and location problems. Menci\u00f3n Internacional.<br \/>Doctorando: Carlos Valverde Mart\u00edn.<br \/>Universidad: Universidad de Sevilla.<br \/>Facultad \/ Escuela: Departamento de Estad\u00edstica e Investigaci\u00f3n Operativa.<br \/>Fecha: 19-01-2023.\u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 \u00a0 Director: Justo Puerto Albandoz.<\/li><\/ul><\/div>\n\t\t\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-44a42d1 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"44a42d1\" data-element_type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t\t\t<div class=\"elementor-row\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-726903e\" data-id=\"726903e\" data-element_type=\"column\">\n\t\t\t<div class=\"elementor-column-wrap elementor-element-populated\">\n\t\t\t\t\t\t\t<div class=\"elementor-widget-wrap\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-4ba4d69 elementor-widget elementor-widget-spacer\" data-id=\"4ba4d69\" data-element_type=\"widget\" data-widget_type=\"spacer.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t<div class=\"elementor-spacer\">\n\t\t\t<div class=\"elementor-spacer-inner\"><\/div>\n\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t","protected":false},"excerpt":{"rendered":"<p>Publicaciones Publicaciones en libros y revistas 2016 2017 2018 2019 2020 2021 2022 2023 2024 2016 Labbe, Martine; Ponce-L\u00f3pez, Diego; Puerto-Albandoz, Justo. \u00abA Comparative Study of Formulations and Solution Methods for the Discrete Ordered p-Median Problem\u00bb.Computers &amp; Operations Research n.78 230-242 (2016). Fern\u00e1ndez-areizaga, Elena; Pozo, Miguel A.; Puerto-Albandoz, Justo; Scozzari, Andrea. \u00abOrdered Weighted Average Optimization&hellip;&nbsp;<a href=\"https:\/\/grupo.us.es\/fqm331\/publicaciones\/\" class=\"\" rel=\"bookmark\">Leer m\u00e1s &raquo;<span class=\"screen-reader-text\">Publicaciones<\/span><\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"neve_meta_sidebar":"","neve_meta_container":"","neve_meta_enable_content_width":"off","neve_meta_content_width":70,"neve_meta_title_alignment":"","neve_meta_author_avatar":"","neve_post_elements_order":"","neve_meta_disable_header":"","neve_meta_disable_footer":"on","neve_meta_disable_title":"on"},"_links":{"self":[{"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/pages\/70"}],"collection":[{"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/comments?post=70"}],"version-history":[{"count":297,"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/pages\/70\/revisions"}],"predecessor-version":[{"id":1933,"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/pages\/70\/revisions\/1933"}],"wp:attachment":[{"href":"https:\/\/grupo.us.es\/fqm331\/wp-json\/wp\/v2\/media?parent=70"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}