Alfredo Marín

54 papers Journal 53Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Intra-facility equity in discrete and continuous p-facility location problems.
Comput. Oper. Res.
Víctor Blanco, Alfredo Marín, Justo Puerto
2023 J jnl
A new formulation and branch-and-cut method for single-allocation hub location problems.
Comput. Oper. Res.
Inmaculada Espejo, Alfredo Marín, Juan Manuel Muñoz-Ocaña, Antonio M. Rodríguez-Chía
2023 J jnl
Dynamically second-preferred p-center problem.
Eur. J. Oper. Res.
Yolanda Hinojosa, Alfredo Marín, Justo Puerto
2023 J jnl
On clustering and interpreting with rules by means of mathematical optimization.
Comput. Oper. Res.
Emilio Carrizosa, Kseniia Kurishchenko, Alfredo Marín, Dolores Romero Morales
2023 J jnl
The p-median problem with upgrading of transportation costs and minimum travel time allocation.
Comput. Oper. Res.
Inmaculada Espejo, Alfredo Marín
2022 J jnl
Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy.
Comput. Oper. Res.
Concepción Domínguez, Martine Labbé, Alfredo Marín
2022 J jnl
The soft-margin Support Vector Machine with ordered weighted average.
Knowl. Based Syst.
Alfredo Marín, Luisa I. Martínez-Merino, Justo Puerto, Antonio M. Rodríguez-Chía
2022 J jnl
Upgrading edges in the maximal covering location problem.
Eur. J. Oper. Res.
Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía
2021 J jnl
Finding the root graph through minimum edge deletion.
Eur. J. Oper. Res.
Martine Labbé, Alfredo Marín, Mercedes Pelegrín
2021 J jnl
The double-assignment plant location problem with co-location.
Comput. Oper. Res.
Alfredo Marín, Mercedes Pelegrín
2021 J jnl
The rank pricing problem with ties.
Eur. J. Oper. Res.
Concepción Domínguez, Martine Labbé, Alfredo Marín
2020 J jnl
A fresh view on the Discrete Ordered Median Problem based on partial monotonicity.
Eur. J. Oper. Res.
Alfredo Marín, Diego Ponce, Justo Puerto
2020 J jnl
Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality.
IEEE Syst. J.
Emilio Carrizosa, Alfredo Marín, Mercedes Pelegrín
2019 J jnl
A new lifting theorem for vertex packing.
Optim. Lett.
Alfredo Marín, Mercedes Pelegrín
2019 J jnl
Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience.
Comput. Oper. Res.
Alfredo Marín, Mercedes Pelegrín-García
2019 J jnl
Locating switches.
Expert Syst. Appl.
Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo
2019 J jnl
Reformulated acyclic partitioning for rail-rail containers transshipment.
Eur. J. Oper. Res.
Maria Albareda-Sambola, Alfredo Marín, Antonio M. Rodríguez-Chía
2019 J jnl
The rank pricing problem: Models and branch-and-cut algorithms.
Comput. Oper. Res.
Herminia I. Calvete, Concepción Domínguez, Carmen Galé, Martine Labbé, Alfredo Marín
2019 J jnl
Upgrading nodes in tree-shaped hub location.
Comput. Oper. Res.
Víctor Blanco, Alfredo Marín
2018 J jnl
Multi-period stochastic covering location problems: Modeling framework and solution approach.
Eur. J. Oper. Res.
Alfredo Marín, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía, Francisco Saldanha-da-Gama
2018 J jnl
Towards unambiguous map labeling - Integer programming approach and heuristic algorithm.
Expert Syst. Appl.
Alfredo Marín, Mercedes Pelegrín-García
2018 J jnl
Upgrading nodes in tree-shaped hub location.
CoRR
Víctor Blanco, Alfredo Marín
2017 J jnl
Decomposition methods based on articulation vertices for degree-dependent spanning tree problems.
Comput. Optim. Appl.
Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo
2016 J jnl
A parallelized Lagrangean relaxation approach for the discrete ordered median problem.
Ann. Oper. Res.
Juana López Redondo, Alfredo Marín, Pilar M. Ortigosa
2016 J jnl
Balancing the arrival times of users in a two-stage location problem.
Ann. Oper. Res.
Maria Barbati, Giuseppe Bruno, Alfredo Marín
2015 J jnl
Capacitated p-center problem with failure foresight.
Eur. J. Oper. Res.
Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía
2015 J jnl
Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem.
Eur. J. Oper. Res.
Alfredo Marín
2015 J jnl
When centers can fail: A close second opportunity.
Comput. Oper. Res.
Maria Albareda-Sambola, Yolanda Hinojosa, Alfredo Marín, Justo Puerto
2014 J jnl
Looking for edge-equitable spanning trees.
Comput. Oper. Res.
Mercedes Landete, Alfredo Marín
2012 J jnl
Closest assignment constraints in discrete location problems.
Eur. J. Oper. Res.
Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía
2012 J jnl
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem.
Eur. J. Oper. Res.
Sergio García, Mercedes Landete, Alfredo Marín
2011 J jnl
Solving Large
INFORMS J. Comput.
Sergio García, Martine Labbé, Alfredo Marín
2011 J jnl
The discrete facility location problem with balanced allocation of customers.
Eur. J. Oper. Res.
Alfredo Marín
2010 J jnl
An extended covering model for flexible discrete and equity location problems.
Math. Methods Oper. Res.
Alfredo Marín, Stefan Nickel, Sebastian Velten
2010 J jnl
The Tree of Hubs Location Problem.
Eur. J. Oper. Res.
Iván A. Contreras, Elena Fernández, Alfredo Marín
2009 J jnl
A branch-and-cut algorithm for the Winner Determination Problem.
Decis. Support Syst.
Laureano F. Escudero, Mercedes Landete, Alfredo Marín
2009 J jnl
A comparison of formulations and solution methods for the minimum-envy location problem.
Comput. Oper. Res.
Inmaculada Espejo, Alfredo Marín, Justo Puerto, Antonio M. Rodríguez-Chía
2009 J jnl
A flexible model and efficient solution strategies for discrete location problems.
Discret. Appl. Math.
Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten
2009 J jnl
New facets for the two-stage uncapacitated facility location polytope.
Comput. Optim. Appl.
Mercedes Landete, Alfredo Marín
2009 J jnl
Tight bounds from a path based formulation for the tree of hub location problem.
Comput. Oper. Res.
Iván A. Contreras, Elena Fernández, Alfredo Marín
2008 J jnl
New trends in locational analysis.
Comput. Oper. Res.
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 M. Ndiaye, Stefan Nickel, Blas Pelegrín
2007 J jnl
A strengthened formulation for the simple plant location problem with order.
Oper. Res. Lett.
Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín
2007 J jnl
Lower bounds for the two-stage uncapacitated facility location problem.
Eur. J. Oper. Res.
Alfredo Marín
2007 J jnl
Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.
Eur. J. Oper. Res.
Lázaro Cánovas, Sergio García, Alfredo Marín
2006 J jnl
New formulations for the uncapacitated multiple allocation hub location problem.
Eur. J. Oper. Res.
Alfredo Marín, Lázaro Cánovas, Mercedes Landete
2005 — conf
A Flexible Model and Efficient Solution Strategies for Discrete Location Problems.
OR
Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten
2005 J jnl
Formulating and solving splittable capacitated multiple allocation hub location problems.
Comput. Oper. Res.
Alfredo Marín
2005 J jnl
Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm.
J. Glob. Optim.
Alfredo Marín
2002 J jnl
Facet Obtaining Procedures for Set Packing Problems.
SIAM J. Discret. Math.
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
2002 J jnl
On the convergence of the Weiszfeld algorithm.
Math. Program.
Lázaro Cánovas, Roberto Cañavate, Alfredo Marín
2002 J jnl
On the facets of the simple plant location packing polytope.
Discret. Appl. Math.
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
2000 J jnl
New facets for the set packing polytope.
Oper. Res. Lett.
Lázaro Cánovas, Mercedes Landete, Alfredo Marín
1999 J jnl
Applying Lagrangian relaxation to the resolution of two-stage location problems.
Ann. Oper. Res.
Alfredo Marín, Blas Pelegrín
1997 J jnl
A branch-and-bound algorithm for the transportation problem with location of
Comput. Oper. Res.
Alfredo Marín, Blas Pelegrín