Alfredo Marín

According to our database, Alfredo Marín authored at least 52 papers between 1997 and 2024.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2024

Intra-facility equity in discrete and continuous p-facility location problems.

Víctor Blanco, Alfredo Marín, Justo Puerto

Comput. Oper. Res., February, 2024

2023

The p-median problem with upgrading of transportation costs and minimum travel time allocation.

Inmaculada Espejo, Alfredo Marín

Comput. Oper. Res., November, 2023

A new formulation and branch-and-cut method for single-allocation hub location problems.

Inmaculada Espejo, Alfredo Marín, Juan Manuel Muñoz-Ocaña, Antonio M. Rodríguez-Chía

Comput. Oper. Res., July, 2023

On clustering and interpreting with rules by means of mathematical optimization.

Emilio Carrizosa, Kseniia Kurishchenko, Alfredo Marín, Dolores Romero Morales

Comput. Oper. Res., June, 2023

Dynamically second-preferred p-center problem.

Yolanda Hinojosa, Alfredo Marín, Justo Puerto

Eur. J. Oper. Res., May, 2023

2022

The soft-margin Support Vector Machine with ordered weighted average.

Alfredo Marín, Luisa I. Martínez-Merino, Justo Puerto, Antonio M. Rodríguez-Chía

Knowl. Based Syst., 2022

Upgrading edges in the maximal covering location problem.

Marta Baldomero-Naranjo, Jörg Kalcsics, Alfredo Marín, Antonio M. Rodríguez-Chía

Eur. J. Oper. Res., 2022

Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy.

Concepción Domínguez, Martine Labbé, Alfredo Marín

Comput. Oper. Res., 2022

2021

Finding the root graph through minimum edge deletion.

Martine Labbé, Alfredo Marín, Mercedes Pelegrín

Eur. J. Oper. Res., 2021

The rank pricing problem with ties.

Concepción Domínguez, Martine Labbé, Alfredo Marín

Eur. J. Oper. Res., 2021

The double-assignment plant location problem with co-location.

Alfredo Marín, Mercedes Pelegrín

Comput. Oper. Res., 2021

2020

Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality.

Emilio Carrizosa, Alfredo Marín, Mercedes Pelegrín

IEEE Syst. J., 2020

A fresh view on the Discrete Ordered Median Problem based on partial monotonicity.

Alfredo Marín, Diego Ponce, Justo Puerto

Eur. J. Oper. Res., 2020

2019

A new lifting theorem for vertex packing.

Alfredo Marín, Mercedes Pelegrín

Optim. Lett., 2019

Locating switches.

Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo

Expert Syst. Appl., 2019

Reformulated acyclic partitioning for rail-rail containers transshipment.

Maria Albareda-Sambola, Alfredo Marín, Antonio M. Rodríguez-Chía

Eur. J. Oper. Res., 2019

Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience.

Alfredo Marín, Mercedes Pelegrín-García

Comput. Oper. Res., 2019

The rank pricing problem: Models and branch-and-cut algorithms.

Herminia I. Calvete, Concepción Domínguez, Carmen Galé, Martine Labbé, Alfredo Marín

Comput. Oper. Res., 2019

Upgrading nodes in tree-shaped hub location.

Víctor Blanco, Alfredo Marín

Comput. Oper. Res., 2019

2018

Towards unambiguous map labeling - Integer programming approach and heuristic algorithm.

Alfredo Marín, Mercedes Pelegrín-García

Expert Syst. Appl., 2018

Multi-period stochastic covering location problems: Modeling framework and solution approach.

Alfredo Marín, Luisa I. Martínez-Merino, Antonio M. Rodríguez-Chía, Francisco Saldanha-da-Gama

Eur. J. Oper. Res., 2018

2017

Decomposition methods based on articulation vertices for degree-dependent spanning tree problems.

Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo

Comput. Optim. Appl., 2017

2016

A parallelized Lagrangean relaxation approach for the discrete ordered median problem.

Juana López Redondo, Alfredo Marín, Pilar M. Ortigosa

Ann. Oper. Res., 2016

Balancing the arrival times of users in a two-stage location problem.

Maria Barbati, Giuseppe Bruno, Alfredo Marín

Ann. Oper. Res., 2016

2015

Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem.

Alfredo Marín

Eur. J. Oper. Res., 2015

Capacitated p-center problem with failure foresight.

Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía

Eur. J. Oper. Res., 2015

When centers can fail: A close second opportunity.

Maria Albareda-Sambola, Yolanda Hinojosa, Alfredo Marín, Justo Puerto

Comput. Oper. Res., 2015

2014

Looking for edge-equitable spanning trees.

Mercedes Landete, Alfredo Marín

Comput. Oper. Res., 2014

2012

New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem.

Sergio García, Mercedes Landete, Alfredo Marín

Eur. J. Oper. Res., 2012

Closest assignment constraints in discrete location problems.

Inmaculada Espejo, Alfredo Marín, Antonio M. Rodríguez-Chía

Eur. J. Oper. Res., 2012

2011

Solving Large <i>p</i>-Median Problems with a Radius Formulation.

Sergio García, Martine Labbé, Alfredo Marín

INFORMS J. Comput., 2011

The discrete facility location problem with balanced allocation of customers.

Alfredo Marín

Eur. J. Oper. Res., 2011

2010

An extended covering model for flexible discrete and equity location problems.

Alfredo Marín, Stefan Nickel, Sebastian Velten

Math. Methods Oper. Res., 2010

The Tree of Hubs Location Problem.

Iván A. Contreras, Elena Fernández, Alfredo Marín

Eur. J. Oper. Res., 2010

2009

A branch-and-cut algorithm for the Winner Determination Problem.

Laureano F. Escudero, Mercedes Landete, Alfredo Marín

Decis. Support Syst., 2009

A flexible model and efficient solution strategies for discrete location problems.

Alfredo Marín, Stefan Nickel, Justo Puerto, Sebastian Velten

Discret. Appl. Math., 2009

A comparison of formulations and solution methods for the minimum-envy location problem.

Inmaculada Espejo, Alfredo Marín, Justo Puerto, Antonio M. Rodríguez-Chía

Comput. Oper. Res., 2009

Tight bounds from a path based formulation for the tree of hub location problem.

Iván A. Contreras, Elena Fernández, Alfredo Marín

Comput. Oper. Res., 2009

New facets for the two-stage uncapacitated facility location polytope.

Mercedes Landete, Alfredo Marín

Comput. Optim. Appl., 2009

2008

New trends in locational analysis.

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

Comput. Oper. Res., 2008

2007

A strengthened formulation for the simple plant location problem with order.

Lázaro Cánovas, Sergio García, Martine Labbé, Alfredo Marín

Oper. Res. Lett., 2007

Lower bounds for the two-stage uncapacitated facility location problem.

Alfredo Marín

Eur. J. Oper. Res., 2007

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique.

Lázaro Cánovas, Sergio García, Alfredo Marín

Eur. J. Oper. Res., 2007

2006

New formulations for the uncapacitated multiple allocation hub location problem.

Alfredo Marín, Lázaro Cánovas, Mercedes Landete

Eur. J. Oper. Res., 2006

2005

Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm.

Alfredo Marín

J. Glob. Optim., 2005

Formulating and solving splittable capacitated multiple allocation hub location problems.

Alfredo Marín

Comput. Oper. Res., 2005

2002

Facet Obtaining Procedures for Set Packing Problems.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

SIAM J. Discret. Math., 2002

On the convergence of the Weiszfeld algorithm.

Lázaro Cánovas, Roberto Cañavate, Alfredo Marín

Math. Program., 2002

On the facets of the simple plant location packing polytope.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

Discret. Appl. Math., 2002

2000

New facets for the set packing polytope.

Lázaro Cánovas, Mercedes Landete, Alfredo Marín

Oper. Res. Lett., 2000

1999

Applying Lagrangian relaxation to the resolution of two-stage location problems.

Alfredo Marín, Blas Pelegrín

Ann. Oper. Res., 1999

1997

A branch-and-bound algorithm for the transportation problem with location of <i>p</i> transshipment points.

Alfredo Marín, Blas Pelegrín

Comput. Oper. Res., 1997