The following pages link to Telmo Pinto (Q1665693):
Displaying 6 items.
- Solving the multiscenario max-MIN knapsack problem exactly with column generation and branch-and-bound (Q1665694) (← links)
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints (Q1680068) (← links)
- Variable neighborhood search algorithms for pickup and delivery problems with loading constraints (Q1687656) (← links)
- Column generation based primal heuristics for routing and loading problems (Q1742212) (← links)
- A variable neighborhood search algorithm for the leather nesting problem (Q1954576) (← links)
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)