Pages that link to "Item:Q2140338"

The following pages link to A branch-and-cut algorithm for the vehicle routing problem with two-dimensional loading constraints (Q2140338):

Displaying 9 items.

• A branch-and-price algorithm for the vehicle routing problem with 2-dimensional loading constraints (Q1680068) (← links)
• A branch-and-cut algorithm for the two-echelon capacitated vehicle routing problem with grouping constraints (Q1754109) (← links)
• An exact approach for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q2669556) (← links)
• The enhanced tabu search algorithm for solving low-carbon vehicle routing problem with two-dimensional box constraints (Q3131629) (← links)
• Learning-Based Branch-and-Price Algorithms for the Vehicle Routing Problem with Time Windows and Two-Dimensional Loading Constraints (Q5087714) (← links)
• Erratum: A Tabu search heuristic for the vehicle routing problem with two‐dimensional loading constraints (Q5449670) (← links)
• Modelling and heuristically solving many-to-many heterogeneous vehicle routing problem with cross-docking and two-dimensional loading constraints (Q6106775) (← links)
• A branch‐and‐price‐based heuristic for the vehicle routing problem with two‐dimensional loading constraints and time windows (Q6187233) (← links)
• A variable neighborhood search for the green vehicle routing problem with two-dimensional loading constraints and split delivery (Q6565397) (← links)