Pages that link to "Item:Q421467"

The following pages link to Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467):

Displaying 2 items.

• Combining probabilistic algorithms, constraint programming and Lagrangian relaxation to solve the vehicle routing problem (Q421467) (← links)
• Combining biased randomization with iterated local search for solving the multidepot vehicle routing problem (Q2794677) (← links)