Mercedes Landete

37 papers Journal 37
YearRankTypeTitle / Venue / Authors
2026 J jnl
Mixed-integer models for complete-linkage clustering.
Ann. Oper. Res.
Martine Labbé, Mercedes Landete, Marina Leal, Lorena Nácher
2025 J jnl
A modified single-objective genetic algorithm for solving the rural postman problem with load-dependent costs.
Knowl. Based Syst.
David De Santis, Mercedes Landete, Xavier Cabezas, José María Sanchis, Juanjo Peiró
2025 J jnl
New models for close enough facility location problems.
Comput. Oper. Res.
Alejandro Moya-Martínez, Mercedes Landete, Juan F. Monge, Sergio García
2025 J jnl
The Capacitated Vehicle Routing Problem with Planned Downtime.
Comput. Optim. Appl.
Mercedes Landete, Marina Leal, Juan Francisco Monge, Inmaculada Rodríguez Martín
2024 J jnl
Some new clique inequalities in four-index hub location models.
Eur. J. Oper. Res.
Mercedes Landete, Juanjo Peiró
2023 J jnl
An exact approach for the reliable fixed-charge location problem with capacity constraints.
Eur. J. Oper. Res.
Maria Albareda-Sambola, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo
2023 J jnl
Comparing two SVM models through different metrics based on the confusion matrix.
Comput. Oper. Res.
Daniel Valero-Carreras, Javier Alcaraz, Mercedes Landete
2023 J jnl
Dendrograms, minimum spanning trees and feature selection.
Eur. J. Oper. Res.
Martine Labbé, Mercedes Landete, Marina Leal
2023 J jnl
Formulations and valid inequalities for the capacitated dispersion problem.
Networks
Mercedes Landete, Juanjo Peiró, Hande Yaman
2023 J jnl
Upgrading edges in the Graphical TSP.
Comput. Oper. Res.
Mercedes Landete, Isaac Plana, José Luis Sainz-Pardo, José María Sanchis
2022 J jnl
Support Vector Machine with feature selection: A multiobjective approach.
Expert Syst. Appl.
Javier Alcaraz, Martine Labbé, Mercedes Landete
2021 J jnl
The single-vehicle two-echelon one-commodity pickup and delivery problem.
Comput. Oper. Res.
Hipólito Hernández-Pérez, Mercedes Landete, Inmaculada Rodríguez Martín
2020 J jnl
A linear ordering problem of sets.
Ann. Oper. Res.
Juan Aparicio, Mercedes Landete, Juan F. Monge
2020 J jnl
Multi-objective evolutionary algorithms for a reliability location problem.
Eur. J. Oper. Res.
Javier Alcaraz, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo
2019 J jnl
Locating switches.
Expert Syst. Appl.
Mercedes Landete, Alfredo Marín, José L. Sainz-Pardo
2019 J jnl
Median and covering location problems with interconnected facilities.
Comput. Oper. Res.
Marilène Cherkesly, Mercedes Landete, Gilbert Laporte
2019 J jnl
The probabilistic pickup-and-delivery travelling salesman problem.
Expert Syst. Appl.
Enrique Benavent, Mercedes Landete, Juan José Salazar González, Gregorio Tirado
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
2017 J jnl
Introducing capacities in the location of unreliable facilities.
Eur. J. Oper. Res.
Maria Albareda-Sambola, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo
2017 J jnl
On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem.
J. Glob. Optim.
José L. Sainz-Pardo, Javier Alcaraz, Mercedes Landete, Juan F. Monge
2017 J jnl
Rank aggregation in cyclic sequences.
Optim. Lett.
Eva M. García-Nové, Javier Alcaraz, Mercedes Landete, Juan F. Monge, Justo Puerto
2017 J jnl
Robust DEA efficiency scores: A probabilistic/combinatorial approach.
Expert Syst. Appl.
Mercedes Landete, Juan F. Monge, José L. Ruiz
2016 J jnl
A polyhedral study on 0-1 knapsack problems with set packing constraints.
Oper. Res. Lett.
Roberto Cañavate, Mercedes Landete
2015 J jnl
Strengthening the reliability fixed-charge location model using clique constraints.
Comput. Oper. Res.
Javier Alcaraz, Mercedes Landete, Juan F. Monge, José L. Sainz-Pardo
2015 J jnl
The multiple vehicle pickup and delivery problem with LIFO constraints.
Eur. J. Oper. Res.
Enrique Benavent, Mercedes Landete, Enrique Mota, Gregorio Tirado
2014 J jnl
Looking for edge-equitable spanning trees.
Comput. Oper. Res.
Mercedes Landete, Alfredo Marín
2013 J jnl
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem.
Ann. Oper. Res.
Mercedes Landete, Juan Francisco Monge, Antonio M. Rodríguez-Chía
2012 J jnl
Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem.
Eur. J. Oper. Res.
Javier Alcaraz, Mercedes Landete, Juan F. Monge
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
Stochastic set packing problem.
Eur. J. Oper. Res.
Laureano F. Escudero, Mercedes Landete, Antonio M. Rodríguez-Chía
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
New facets for the two-stage uncapacitated facility location polytope.
Comput. Optim. Appl.
Mercedes Landete, 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
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
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 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