Alfredo Marín

Publication Activity (10 Years)

Years Active: 1997-2023
Publications (10 Years): 21

Top Topics

Weighted Average

Integer Programming

Top Venues

Eur. J. Oper. Res.

Comput. Oper. Res.

Ann. Oper. Res.

Expert Syst. Appl.

Publications

Yolanda Hinojosa, Alfredo Marín, Justo Puerto
Dynamically second-preferred p-center problem. Eur. J. Oper. Res. 307 (1) (2023)
Alfredo Marín, Luisa I. Martínez-Merino, Justo Puerto, Antonio M. Rodríguez-Chía
The soft-margin Support Vector Machine with ordered weighted average. Knowl. Based Syst. 237 (2022)
Concepción Domínguez, Martine Labbé, Alfredo Marín
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. Comput. Oper. Res. 140 (2022)
Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía
Upgrading edges in the maximal covering location problem. Eur. J. Oper. Res. 303 (1) (2022)
Alfredo Marín, Mercedes Pelegrín
The double-assignment plant location problem with co-location. Comput. Oper. Res. 126 (2021)
Martine Labbé, Alfredo Marín, Mercedes Pelegrín
Finding the root graph through minimum edge deletion. Eur. J. Oper. Res. 289 (1) (2021)
Concepción Domínguez, Martine Labbé, Alfredo Marín
The rank pricing problem with ties. Eur. J. Oper. Res. 294 (2) (2021)
Emilio Carrizosa, Alfredo Marín, Mercedes Pelegrín
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality. IEEE Syst. J. 14 (3) (2020)
Alfredo Marín, Diego Ponce, Justo Puerto
A fresh view on the Discrete Ordered Median Problem based on partial monotonicity. Eur. J. Oper. Res. 286 (3) (2020)
Alfredo Marín, Mercedes Pelegrín-García
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. Comput. Oper. Res. 104 (2019)
Víctor Blanco, Alfredo Marín
Upgrading nodes in tree-shaped hub location. Comput. Oper. Res. 102 (2019)
Maria Albareda-Sambola, Alfredo Marín, Antonio M. Rodríguez-Chía
Reformulated acyclic partitioning for rail-rail containers transshipment. Eur. J. Oper. Res. 277 (1) (2019)
Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo
Locating switches. Expert Syst. Appl. 136 (2019)
Herminia I. Calvete, Concepción Domínguez, Carmen Galé, Martine Labbé, Alfredo Marín
The rank pricing problem: Models and branch-and-cut algorithms. Comput. Oper. Res. 105 (2019)
Alfredo Marín, Mercedes Pelegrín
A new lifting theorem for vertex packing. Optim. Lett. 13 (6) (2019)
Alfredo Marín, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía, Francisco Saldanha-da-Gama
Multi-period stochastic covering location problems: Modeling framework and solution approach. Eur. J. Oper. Res. 268 (2) (2018)
Alfredo Marín, Mercedes Pelegrín-García
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm. Expert Syst. Appl. 98 (2018)
Víctor Blanco, Alfredo Marín
Upgrading nodes in tree-shaped hub location. CoRR (2018)
Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. Comput. Optim. Appl. 68 (3) (2017)
Maria Barbati, Giuseppe Bruno, Alfredo Marín
Balancing the arrival times of users in a two-stage location problem. Ann. Oper. Res. 246 (1-2) (2016)
Juana López Redondo, Alfredo Marín, Pilar M. Ortigosa
A parallelized Lagrangean relaxation approach for the discrete ordered median problem. Ann. Oper. Res. 246 (1-2) (2016)
Alfredo Marín
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. Eur. J. Oper. Res. 245 (3) (2015)
Maria Albareda-Sambola, Yolanda Hinojosa, Alfredo Marín, Justo Puerto
When centers can fail: A close second opportunity. Comput. Oper. Res. 62 (2015)
Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía
Capacitated p-center problem with failure foresight. Eur. J. Oper. Res. 247 (1) (2015)
Mercedes Landete, Alfredo Marín
Looking for edge-equitable spanning trees. Comput. Oper. Res. 41 (2014)
Sergio García, Mercedes Landete, Alfredo Marín
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. Eur. J. Oper. Res. 220 (1) (2012)
Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía
Closest assignment constraints in discrete location problems. Eur. J. Oper. Res. 219 (1) (2012)
Sergio García, Martine Labbé, Alfredo Marín
-Median Problems with a Radius Formulation. INFORMS J. Comput. 23 (4) (2011)
Alfredo Marín
The discrete facility location problem with balanced allocation of customers. Eur. J. Oper. Res. 210 (1) (2011)
Iván A. Contreras, Elena Fernández, Alfredo Marín
The Tree of Hubs Location Problem. Eur. J. Oper. Res. 202 (2) (2010)
Alfredo Marín, Stefan Nickel, Sebastian Velten
An extended covering model for flexible discrete and equity location problems. Math. Methods Oper. Res. 71 (1) (2010)
Iván A. Contreras, Elena Fernández, Alfredo Marín
Tight bounds from a path based formulation for the tree of hub location problem. Comput. Oper. Res. 36 (12) (2009)
Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten
A flexible model and efficient solution strategies for discrete location problems. Discret. Appl. Math. 157 (5) (2009)
Laureano F. Escudero, Mercedes Landete, Alfredo Marín
A branch-and-cut algorithm for the Winner Determination Problem. Decis. Support Syst. 46 (3) (2009)
Inmaculada Espejo, Alfredo Marín, Justo Puerto, Antonio M. Rodríguez-Chía
A comparison of formulations and solution methods for the minimum-envy location problem. Comput. Oper. Res. 36 (6) (2009)
Mercedes Landete, Alfredo Marín
New facets for the two-stage uncapacitated facility location polytope. Comput. Optim. Appl. 44 (3) (2009)
S. Arifusalem, Stefano Benati, Brian Boffey, Teresa Cáceres, Dietmar Cieslik, Zvi Drezner, Horst A. Eiselt, Ioannis Giannikos, Horst W. Hamacher, John M. Hodgson, Jörg Kalcsics, Kathrin Klamroth, Olivier Klopfenstein, Mercedes Landete, Maria Cruz López de los Mozos Martin, Alfredo Marín, Juan A. Mesa, Malick Ndiaye, Stefan Nickel, Blas Pelegrín
New trends in locational analysis. Comput. Oper. Res. 35 (3) (2008)
Lázaro Cánovas, Sergio García, Alfredo Marín
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. Eur. J. Oper. Res. 179 (3) (2007)
Alfredo Marín
Lower bounds for the two-stage uncapacitated facility location problem. Eur. J. Oper. Res. 179 (3) (2007)
Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín
A strengthened formulation for the simple plant location problem with order. Oper. Res. Lett. 35 (2) (2007)
Alfredo Marín, Lázaro Cánovas, Mercedes Landete
New formulations for the uncapacitated multiple allocation hub location problem. Eur. J. Oper. Res. 172 (1) (2006)
Alfredo Marín
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm. J. Glob. Optim. 33 (3) (2005)
Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten
A Flexible Model and Efficient Solution Strategies for Discrete Location Problems. OR (2005)
Alfredo Marín
Formulating and solving splittable capacitated multiple allocation hub location problems. Comput. Oper. Res. 32 (2005)
Lázaro Cánovas, Roberto Cañavate, Alfredo Marín
On the convergence of the Weiszfeld algorithm. Math. Program. 93 (2) (2002)
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
Facet Obtaining Procedures for Set Packing Problems. SIAM J. Discret. Math. 16 (1) (2002)
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
On the facets of the simple plant location packing polytope. Discret. Appl. Math. 124 (1-3) (2002)
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
New facets for the set packing polytope. Oper. Res. Lett. 27 (4) (2000)
Alfredo Marín, Blas Pelegrín
Applying Lagrangian relaxation to the resolution of two-stage location problems. Ann. Oper. Res. 86 (1999)
Alfredo Marín, Blas Pelegrín
transshipment points. Comput. Oper. Res. 24 (7) (1997)