Paquete Lus

Lus Paquete

Information about the author Lus Paquete will soon be added to the site.
Found 5 papers in total
Easy to say they are Hard, but Hard to see they are Easy– Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
Easy to say they are Hard, but Hard to see they are Easy– Towards a Categorization of Tractable Multiobjective Combinatorial Optimization Problems
2017
Multiobjective combinatorial optimization problems are known to be hard problems for...
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
Algorithmic improvements on dynamic programming for the bi‐objective {0,1} knapsack problem
2013
This paper presents several methodological and algorithmic improvements over a...
Greedy algorithms for a class of knapsack problems with binary weights
Greedy algorithms for a class of knapsack problems with binary weights
2012
In this article we identify a class of two‐dimensional knapsack problems with...
Hybrid population-based algorithms for the bi-objective quadratic assignment problem
Hybrid population-based algorithms for the bi-objective quadratic assignment problem
2006
We present variants of an ant colony optimization (MO-ACO) algorithm and of an...
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
Hybrid metaheuristics for the vehicle routing problem with stochastic demands
2006
This article analyzes the performance of metaheuristics on the vehicle routing problem...
Papers per page: