Riera-Ledesma Jorge

Jorge Riera-Ledesma

Information about the author Jorge Riera-Ledesma will soon be added to the site.
Found 7 papers in total
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch‐and‐cut approach
Solving school bus routing using the multiple vehicle traveling purchaser problem: A branch‐and‐cut approach
2012
School bus routing problems, combining bus stop selection and bus route generation,...
A heuristic approach for the continuous error localization problem in data cleaning
A heuristic approach for the continuous error localization problem in data cleaning
2007
The Error Localization Problem concerns finding the minimum number of fields in a...
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
A branch-and-cut algorithm for the continuous error localization problem in data cleaning
2007
Data collected by statistical agencies may contain mistakes made during the...
A branch-and-cut algorithm for the undirected traveling purchaser problem
A branch-and-cut algorithm for the undirected traveling purchaser problem
2003
The purpose of this paper is to present a branch-and-cut algorithm for the undirected...
Solving the asymmetric traveling purchaser problem
Solving the asymmetric traveling purchaser problem
2006
The Asymmetric Traveling Purchaser Problem (ATPP) is a generalization of the...
A heuristic approach for the Travelling Purchaser Problem
A heuristic approach for the Travelling Purchaser Problem
2005
The Travelling Purchaser Problem (TPP) is a known generalization of the Travelling...
The biobjective travelling purchaser problem
The biobjective travelling purchaser problem
2005
The purpose of this article is to present and solve the Biobjective Travelling...
Papers per page: