Intra-facility equity in discrete and continuous p-facility location problems. - Blanco, Víctor; Marín, Alfredo; Puerto, Justo (Comput. Oper. Res., 2024)

On clustering and interpreting with rules by means of mathematical optimization. - Carrizosa, Emilio; Kurishchenko, Kseniia; Marín, Alfredo; Morales, Dolores Romero (Comput. Oper. Res., 2023)

A new formulation and branch-and-cut method for single-allocation hub location problems. - Espejo, Inmaculada; Marín, Alfredo; Muñoz-Ocaña, Juan Manuel; Rodríguez-Chía, Antonio M. (Comput. Oper. Res., 2023)

The p-median problem with upgrading of transportation costs and minimum travel time allocation. - Espejo, Inmaculada; Marín, Alfredo (Comput. Oper. Res., 2023)

Dynamically second-preferred p-center problem. - Hinojosa, Yolanda; Marín, Alfredo; Puerto, Justo (Eur. J. Oper. Res., 2023)

Mixed-integer formulations for the Capacitated Rank Pricing Problem with envy. - Domínguez, Concepción; Labbé, Martine; Marín, Alfredo (Comput. Oper. Res., 2022)

Upgrading edges in the maximal covering location problem. - Baldomero-Naranjo, Marta; Kalcsics, Jörg; Marín, Alfredo; Rodríguez-Chía, Antonio M. (Eur. J. Oper. Res., 2022)

The soft-margin Support Vector Machine with ordered weighted average. - Marín, Alfredo; Martínez-Merino, Luisa I.; Puerto, Justo; Rodríguez-Chía, Antonio M. (Knowl. Based Syst., 2022)

The double-assignment plant location problem with co-location. - Marín, Alfredo; Pelegrín, Mercedes (Comput. Oper. Res., 2021)

Finding the root graph through minimum edge deletion. - Labbé, Martine; Marín, Alfredo; Pelegrín, Mercedes (Eur. J. Oper. Res., 2021)

The rank pricing problem with ties. - Domínguez, Concepción; Labbé, Martine; Marín, Alfredo (Eur. J. Oper. Res., 2021)

A fresh view on the Discrete Ordered Median Problem based on partial monotonicity. - Marín, Alfredo; Ponce, Diego; Puerto, Justo (Eur. J. Oper. Res., 2020)

Spotting Key Members in Networks: Clustering-Embedded Eigenvector Centrality. - Carrizosa, Emilio; Marín, Alfredo; Pelegrín, Mercedes (IEEE Syst. J., 2020)

Upgrading nodes in tree-shaped hub location. - Blanco, Víctor; Marín, Alfredo (Comput. Oper. Res., 2019)

Adding incompatibilities to the Simple Plant Location Problem: Formulation, facets and computational experience. - Marín, Alfredo; Pelegrín-García, Mercedes (Comput. Oper. Res., 2019)

The rank pricing problem: Models and branch-and-cut algorithms. - Calvete, Herminia I.; Domínguez, Concepción; Galé, Carmen; Labbé, Martine; Marín, Alfredo (Comput. Oper. Res., 2019)

Reformulated acyclic partitioning for rail-rail containers transshipment. - Albareda-Sambola, Maria; Marín, Alfredo; Rodríguez-Chía, Antonio M. (Eur. J. Oper. Res., 2019)

Locating switches. - Landete, Mercedes; Marín, Alfredo; Sainz-Pardo, José L. (Expert Syst. Appl., 2019)

A new lifting theorem for vertex packing. - Marín, Alfredo; Pelegrín, Mercedes (Optim. Lett., 2019)

Multi-period stochastic covering location problems: Modeling framework and solution approach. - Marín, Alfredo; Martínez-Merino, Luisa I.; Rodríguez-Chía, Antonio M.; Saldanha-da-Gama, Francisco (Eur. J. Oper. Res., 2018)

Towards unambiguous map labeling - Integer programming approach and heuristic algorithm. - Marín, Alfredo; Pelegrín-García, Mercedes (Expert Syst. Appl., 2018)

Upgrading nodes in tree-shaped hub location. - Blanco, Víctor; Marín, Alfredo (CoRR, 2018)

Decomposition methods based on articulation vertices for degree-dependent spanning tree problems. - Landete, Mercedes; Marín, Alfredo; Sainz-Pardo, José L. (Comput. Optim. Appl., 2017)

A parallelized Lagrangean relaxation approach for the discrete ordered median problem. - Redondo, Juana López; Marín, Alfredo; Ortigosa, Pilar M. (Ann. Oper. Res., 2016)

Balancing the arrival times of users in a two-stage location problem. - Barbati, Maria; Bruno, Giuseppe; Marín, Alfredo (Ann. Oper. Res., 2016)

When centers can fail: A close second opportunity. - Albareda-Sambola, Maria; Hinojosa, Yolanda; Marín, Alfredo; Puerto, Justo (Comput. Oper. Res., 2015)

Exact and heuristic solutions for the Minimum Number of Branch Vertices Spanning Tree Problem. - Marín, Alfredo (Eur. J. Oper. Res., 2015)

Capacitated p-center problem with failure foresight. - Espejo, Inmaculada; Marín, Alfredo; Rodríguez-Chía, Antonio M. (Eur. J. Oper. Res., 2015)

Looking for edge-equitable spanning trees. - Landete, Mercedes; Marín, Alfredo (Comput. Oper. Res., 2014)

Closest assignment constraints in discrete location problems. - Espejo, Inmaculada; Marín, Alfredo; Rodríguez-Chía, Antonio M. (Eur. J. Oper. Res., 2012)

New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem. - García, Sergio; Landete, Mercedes; Marín, Alfredo (Eur. J. Oper. Res., 2012)

The discrete facility location problem with balanced allocation of customers. - Marín, Alfredo (Eur. J. Oper. Res., 2011)

Solving Large p-Median Problems with a Radius Formulation. - García, Sergio; Labbé, Martine; Marín, Alfredo (INFORMS J. Comput., 2011)

The Tree of Hubs Location Problem. - Contreras, Iván A.; Fernández, Elena; Marín, Alfredo (Eur. J. Oper. Res., 2010)

An extended covering model for flexible discrete and equity location problems. - Marín, Alfredo; Nickel, Stefan; Velten, Sebastian (Math. Methods Oper. Res., 2010)

New facets for the two-stage uncapacitated facility location polytope. - Landete, Mercedes; Marín, Alfredo (Comput. Optim. Appl., 2009)

A comparison of formulations and solution methods for the minimum-envy location problem. - Espejo, Inmaculada; Marín, Alfredo; Puerto, Justo; Rodríguez-Chía, Antonio M. (Comput. Oper. Res., 2009)

Tight bounds from a path based formulation for the tree of hub location problem. - Contreras, Iván A.; Fernández, Elena; Marín, Alfredo (Comput. Oper. Res., 2009)

A flexible model and efficient solution strategies for discrete location problems. - Marín, Alfredo; Nickel, Stefan; Puerto, Justo; Velten, Sebastian (Discret. Appl. Math., 2009)

A branch-and-cut algorithm for the Winner Determination Problem. - Escudero, Laureano F.; Landete, Mercedes; Marín, Alfredo (Decis. Support Syst., 2009)

New trends in locational analysis. - Arifusalem, S.; Benati, Stefano; Boffey, Brian; Cáceres, Teresa; Cieslik, Dietmar; Drezner, Zvi; Eiselt, Horst A.; Giannikos, Ioannis; Hamacher, Horst W.; Hodgson, John M.; Kalcsics, Jörg; Klamroth, Kathrin; et al. (Comput. Oper. Res., 2008)

Solving the uncapacitated multiple allocation hub location problem by means of a dual-ascent technique. - Cánovas, Lázaro; García, Sergio; Marín, Alfredo (Eur. J. Oper. Res., 2007)

Lower bounds for the two-stage uncapacitated facility location problem. - Marín, Alfredo (Eur. J. Oper. Res., 2007)

A strengthened formulation for the simple plant location problem with order. - Cánovas, Lázaro; García, Sergio; Labbé, Martine; Marín, Alfredo (Oper. Res. Lett., 2007)

New formulations for the uncapacitated multiple allocation hub location problem. - Marín, Alfredo; Cánovas, Lázaro; Landete, Mercedes (Eur. J. Oper. Res., 2006)

Formulating and solving splittable capacitated multiple allocation hub location problems. - Marín, Alfredo (Comput. Oper. Res., 2005)

Uncapacitated Euclidean Hub Location: Strengthened Formulation, New Facets and a Relax-and-cut Algorithm. - Marín, Alfredo (J. Glob. Optim., 2005)

A Flexible Model and Efficient Solution Strategies for Discrete Location Problems. - Marín, Alfredo; Nickel, Stefan; Puerto, Justo; Velten, Sebastian (2005)

On the facets of the simple plant location packing polytope. - Cánovas, Lázaro; Landete, Mercedes; Marín, Alfredo (Discret. Appl. Math., 2002)

On the convergence of the Weiszfeld algorithm. - Cánovas, Lázaro; Cañavate, Roberto; Marín, Alfredo (Math. Program., 2002)

Facet Obtaining Procedures for Set Packing Problems. - Cánovas, Lázaro; Landete, Mercedes; Marín, Alfredo (SIAM J. Discret. Math., 2002)

New facets for the set packing polytope. - Cánovas, Lázaro; Landete, Mercedes; Marín, Alfredo (Oper. Res. Lett., 2000)

Applying Lagrangian relaxation to the resolution of two-stage location problems. - Marín, Alfredo; Pelegrín, Blas (Ann. Oper. Res., 1999)

A branch-and-bound algorithm for the transportation problem with location of p transshipment points. - Marín, Alfredo; Pelegrín, Blas (Comput. Oper. Res., 1997)