Mercedes Landete

Orcid: 0000-0002-5201-0476

According to our database1, Mercedes Landete authored at least 34 papers between 2000 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Some new clique inequalities in four-index hub location models.
Eur. J. Oper. Res., 2024

2023
An exact approach for the reliable fixed-charge location problem with capacity constraints.
Eur. J. Oper. Res., November, 2023

Upgrading edges in the Graphical TSP.
Comput. Oper. Res., November, 2023

Dendrograms, minimum spanning trees and feature selection.
Eur. J. Oper. Res., July, 2023

Comparing two SVM models through different metrics based on the confusion matrix.
Comput. Oper. Res., April, 2023

Formulations and valid inequalities for the capacitated dispersion problem.
Networks, March, 2023

2022
Support Vector Machine with feature selection: A multiobjective approach.
Expert Syst. Appl., 2022

2021
The single-vehicle two-echelon one-commodity pickup and delivery problem.
Comput. Oper. Res., 2021

2020
Multi-objective evolutionary algorithms for a reliability location problem.
Eur. J. Oper. Res., 2020

A linear ordering problem of sets.
Ann. Oper. Res., 2020

2019
Locating switches.
Expert Syst. Appl., 2019

The probabilistic pickup-and-delivery travelling salesman problem.
Expert Syst. Appl., 2019

Median and covering location problems with interconnected facilities.
Comput. Oper. Res., 2019

2017
Rank aggregation in cyclic sequences.
Optim. Lett., 2017

On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem.
J. Glob. Optim., 2017

Robust DEA efficiency scores: A probabilistic/combinatorial approach.
Expert Syst. Appl., 2017

Introducing capacities in the location of unreliable facilities.
Eur. J. Oper. Res., 2017

Decomposition methods based on articulation vertices for degree-dependent spanning tree problems.
Comput. Optim. Appl., 2017

2016
A polyhedral study on 0-1 knapsack problems with set packing constraints.
Oper. Res. Lett., 2016

2015
The multiple vehicle pickup and delivery problem with LIFO constraints.
Eur. J. Oper. Res., 2015

Strengthening the reliability fixed-charge location model using clique constraints.
Comput. Oper. Res., 2015

2014
Looking for edge-equitable spanning trees.
Comput. Oper. Res., 2014

2013
Alternative formulations for the Set Packing Problem and their application to the Winner Determination Problem.
Ann. Oper. Res., 2013

2012
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem.
Eur. J. Oper. Res., 2012

Design and analysis of hybrid metaheuristics for the Reliability p-Median Problem.
Eur. J. Oper. Res., 2012

2011
Stochastic set packing problem.
Eur. J. Oper. Res., 2011

2009
A branch-and-cut algorithm for the Winner Determination Problem.
Decis. Support Syst., 2009

New facets for the two-stage uncapacitated facility location polytope.
Comput. Optim. Appl., 2009

2008
New trends in locational analysis.
Comput. Oper. Res., 2008

2006
New formulations for the uncapacitated multiple allocation hub location problem.
Eur. J. Oper. Res., 2006

2002
Facet Obtaining Procedures for Set Packing Problems.
SIAM J. Discret. Math., 2002

On the facets of the simple plant location packing polytope.
Discret. Appl. Math., 2002

2000
New facets for the set packing polytope.
Oper. Res. Lett., 2000

On the resolution of the single product capacitated machine siting problem.
J. Oper. Res. Soc., 2000


  Loading...