Skip to content

You are here: Home / Publications / Congress Communications / Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem

Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem

Guimarans, D.; Herrero, R.; Riera, D.; Juan, A.; Ramos, J.
TYPE OF PARTICIPATION: Presentation in congress

CONGRESS: 17th RCRA International Workshop on Experimental evaluation of algorithms for solving problems with combinatorial explosion (RCRA 2010).

PLACE OF CELEBRATION: Bologna, Italy

DATE: June 10-11, 2010

Filed under: ,