The following pages link to Jorge Riera-Ledesma (Q336444):
Displaying 15 items.
- The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach (Q336445) (← links)
- A column generation approach for a school bus routing problem with resource constraints (Q340259) (← links)
- Exact algorithms for the double vehicle routing problem with multiple stacks (Q342039) (← links)
- A heuristic approach for the travelling purchaser problem (Q707139) (← links)
- Solving the asymmetric traveling purchaser problem (Q867540) (← links)
- A heuristic approach for the continuous error localization problem in data cleaning (Q868999) (← links)
- A branch-and-cut algorithm for the continuous error localization problem in data cleaning (Q875426) (← links)
- The traveling purchaser problem and its variants (Q1751767) (← links)
- Solving the team orienteering arc routing problem with a column generation approach (Q1754007) (← links)
- Solving school bus routing using the multiple vehicle traveling purchaser problem: a branch-and-cut approach (Q1761989) (← links)
- The biobjective travelling purchaser problem (Q1885751) (← links)
- Selective routing problem with synchronization (Q2669549) (← links)
- A Branch-and-Cut Algorithm for the Undirected Traveling Purchaser Problem (Q3637400) (← links)
- Reverse multistar inequalities and vehicle routing problems with a lower bound on the number of customers per route (Q5326796) (← links)
- A branch-and-cut algorithm for the one-commodity pickup and delivery location routing problem (Q6065616) (← links)
