The following pages link to Mercedes Landete (Q170036):
Displaying 31 items.
- The multiple vehicle pickup and delivery problem with LIFO constraints (Q319195) (← links)
- Looking for edge-equitable spanning trees (Q336753) (← links)
- Strengthening the reliability fixed-charge location model using clique constraints (Q337553) (← links)
- Alternative formulations for the set packing problem and their application to the winner determination problem (Q367639) (← links)
- On relaxing the integrality of the allocation variables of the reliability fixed-charge location problem (Q522273) (← links)
- Rank aggregation in cyclic sequences (Q523159) (← links)
- Stochastic set packing problem (Q713096) (← links)
- New formulations for the uncapacitated multiple allocation hub location problem (Q818098) (← links)
- The linear ordering problem with clusters: a new partial ranking (Q828738) (← links)
- A new pricing scheme based on DEA for iterative multi-unit combinatorial auctions (Q1001362) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- Median and covering location problems with interconnected facilities (Q1738812) (← links)
- Introducing capacities in the location of unreliable facilities (Q1751785) (← links)
- A polyhedral study on 0-1 knapsack problems with set packing constraints (Q1785756) (← links)
- On the facets of the simple plant location packing polytope (Q1850113) (← links)
- New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem (Q1926700) (← links)
- Design and analysis of hybrid metaheuristics for the reliability \(p\)-median problem (Q1926910) (← links)
- The single-vehicle two-echelon one-commodity pickup and delivery problem (Q2027019) (← links)
- A linear ordering problem of sets (Q2173116) (← links)
- Multi-objective evolutionary algorithms for a reliability location problem (Q2286920) (← links)
- Facility location problems with user cooperation (Q2421328) (← links)
- New facets for the two-stage uncapacitated facility location polytope (Q2655408) (← links)
- Facet Obtaining Procedures for Set Packing Problems (Q4443075) (← links)
- New facets for the set packing polytope (Q5929145) (← links)
- Extreme points of discrete location polyhedra (Q5945254) (← links)
- Upgrading edges in the graphical TSP (Q6047867) (← links)
- Comparing two SVM models through different metrics based on the confusion matrix (Q6109345) (← links)
- Dendrograms, minimum spanning trees and feature selection (Q6167525) (← links)
- An exact approach for the reliable fixed-charge location problem with capacity constraints (Q6168584) (← links)
- Formulations and valid inequalities for the capacitated dispersion problem (Q6179719) (← links)
- Robust DEA efficiency scores: A probabilistic/combinatorial approach (Q6280082) (← links)
