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

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

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

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

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

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

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

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

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

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

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

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

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; et al. (Comput. Oper. Res., 2008)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Upgrading nodes in tree-shaped hub location. - Víctor Blanco; Alfredo Marín 001 (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 001 (Comput. Oper. Res., 2019)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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