On the resolution of the single product capacitated machine siting problem. - R. Cañavate-Bernal; Mercedes Landete-Ruiz; A. Marín-Pérez (J. Oper. Res. Soc., 2000)

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)

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

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)

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)

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

Stochastic set packing problem. - Laureano F. Escudero; Mercedes Landete; Antonio M. Rodríguez-Chía (Eur. J. Oper. Res., 2011)

Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem. - Javier Alcaraz; Mercedes Landete; Juan F. Monge (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)

Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem. - Mercedes Landete; Juan Francisco Monge; Antonio M. Rodríguez-Chía (Ann. Oper. Res., 2013)

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

Strengthening the reliability fixed-charge location model using clique constraints. - Javier Alcaraz; Mercedes Landete; Juan F. Monge; José L. Sainz-Pardo (Comput. Oper. Res., 2015)

The multiple vehicle pickup and delivery problem with LIFO constraints. - Enrique Benavent; Mercedes Landete; Enrique Mota; Gregorio Tirado (Eur. J. Oper. Res., 2015)

A polyhedral study on 0-1 knapsack problems with set packing constraints. - Roberto Cañavate; Mercedes Landete (Oper. Res. Lett., 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)

Introducing capacities in the location of unreliable facilities. - Maria Albareda-Sambola; Mercedes Landete; Juan F. Monge; José L. Sainz-Pardo (Eur. J. Oper. Res., 2017)

Robust DEA efficiency scores: A probabilistic/combinatorial approach. - Mercedes Landete; Juan F. Monge; José L. Ruiz 002 (Expert Syst. Appl., 2017)

On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem. - José L. Sainz-Pardo; Javier Alcaraz; Mercedes Landete; Juan F. Monge (J. Glob. Optim., 2017)

Rank aggregation in cyclic sequences. - Eva M. García-Nové; Javier Alcaraz; Mercedes Landete; Juan F. Monge; Justo Puerto (Optim. Lett., 2017)

Median and covering location problems with interconnected facilities. - Marilène Cherkesly; Mercedes Landete; Gilbert Laporte (Comput. Oper. Res., 2019)

The probabilistic pickup-and-delivery travelling salesman problem. - Enrique Benavent; Mercedes Landete; Juan José Salazar González; Gregorio Tirado (Expert Syst. Appl., 2019)

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

A linear ordering problem of sets. - Juan Aparicio; Mercedes Landete; Juan F. Monge (Ann. Oper. Res., 2020)

Multi-objective evolutionary algorithms for a reliability location problem. - Javier Alcaraz; Mercedes Landete; Juan F. Monge; José L. Sainz-Pardo (Eur. J. Oper. Res., 2020)

The single-vehicle two-echelon one-commodity pickup and delivery problem. - Hipólito Hernández-Pérez; Mercedes Landete; Inmaculada Rodríguez Martín (Comput. Oper. Res., 2021)

Support Vector Machine with feature selection: A multiobjective approach. - Javier Alcaraz; Martine Labbé; Mercedes Landete (Expert Syst. Appl., 2022)

Formulations and valid inequalities for the capacitated dispersion problem. - Mercedes Landete; Juanjo Peiró; Hande Yaman (Networks, 2023)

Comparing two SVM models through different metrics based on the confusion matrix. - Daniel Valero-Carreras; Javier Alcaraz; Mercedes Landete (Comput. Oper. Res., 2023)

Dendrograms, minimum spanning trees and feature selection. - Martine Labbé; Mercedes Landete; Marina Leal (Eur. J. Oper. Res., 2023)

Upgrading edges in the Graphical TSP. - Mercedes Landete; Isaac Plana; José Luis Sainz-Pardo; José María Sanchis (Comput. Oper. Res., 2023)

An exact approach for the reliable fixed-charge location problem with capacity constraints. - Maria Albareda-Sambola; Mercedes Landete; Juan F. Monge; José L. Sainz-Pardo (Eur. J. Oper. Res., 2023)

Some new clique inequalities in four-index hub location models. - Mercedes Landete; Juanjo Peiró (Eur. J. Oper. Res., 2024)

New models for close enough facility location problems. - Alejandro Moya-Martínez; Mercedes Landete; Juan F. Monge; Sergio García 001 (Comput. Oper. Res., 2025)

A modified single-objective genetic algorithm for solving the rural postman problem with load-dependent costs. - David De Santis; Mercedes Landete; Xavier Cabezas; José María Sanchis; Juanjo Peiró (Knowl. Based Syst., 2025)