Pages that link to "Item:Q421467"
From MaRDI portal
The following pages link to Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467):
Displaying 4 items.
- Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
- An integration of Lagrangian split and VNS: the case of the capacitated vehicle routing problem (Q1652121) (← links)
- Capacitated vehicle routing problem with pick-up and alternative delivery (CVRPPAD): model and implementation using hybrid approach (Q1730665) (← links)
- Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem (Q2794677) (← links)