Pages that link to "Item:Q5433189"
From MaRDI portal
The following pages link to A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5433189):
Displaying 11 items.
- A biased‐randomized algorithm for the two‐dimensional vehicle routing problem with and without item rotations (Q4979997) (← links)
- Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
- A branch‐and‐cut algorithm for the pickup and delivery traveling salesman problem with multiple stacks (Q5326770) (← links)
- A branch‐and‐bound algorithm for the double travelling salesman problem with two stacks (Q5326779) (← links)
- Heuristic solution approaches for the cumulative capacitated vehicle routing problem (Q5746676) (← links)
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet (Q5963103) (← links)
- A branch‐and‐cut algorithm for the pickup‐and‐delivery traveling salesman problem with handling costs (Q6064162) (← links)
- Variable neighborhood search algorithms for the vehicle routing problem with two‐dimensional loading constraints and mixed linehauls and backhauls (Q6066723) (← links)
- The <i>r</i>‐interdiction selective multi‐depot vehicle routing problem (Q6067891) (← links)
- A model‐based heuristic to the vehicle routing and loading problem (Q6088121) (← links)
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)