A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
From MaRDI portal
Publication:2140338
Recommendations
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
Cites work
- scientific article; zbMATH DE number 437525 (Why is no real title available?)
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 1749220 (Why is no real title available?)
- A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- A biased-randomised large neighbourhood search for the two-dimensional vehicle routing problem with backhauls
- A branch and bound algorithm for the strip packing problem
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
- A guided tabu search for the vehicle routing problem with two-dimensional loading constraints
- A new approach to the minimum cut problem
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A simulated annealing algorithm for the capacitated vehicle routing problem with two-dimensional loading constraints
- A variable neighborhood search for the capacitated vehicle routing problem with two-dimensional loading constraints
- An approach to the asymmetric multi-depot capacitated arc routing problem
- An exact algorithm for the two-dimensional orthogonal packing problem with unloading constraints
- An exact algorithm for the two-dimensional strip-packing problem
- An exact approach to the strip-packing problem
- Ant colony optimization for the two-dimensional loading vehicle routing problem
- Combinatorial Benders' cuts for the strip packing problem
- Computer Codes for Problems of Integer Programming
- Extended guided tabu search and a new packing algorithm for the two-dimensional loading vehicle routing problem
- The value of integrating loading and routing
- Using biased randomization for solving the two-dimensional loading vehicle routing problem with heterogeneous fleet
- Vehicle routing problems with loading constraints: state-of-the-art and future directions
Cited in
(9)- Learning-based branch-and-price algorithms for the vehicle routing problem with time windows and two-dimensional loading constraints
- The enhanced tabu search algorithm for solving low-carbon vehicle routing problem with two-dimensional box constraints
- Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints
- An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints
- A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints
- A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery
- A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints
- A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows
This page was built for publication: A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2140338)
