![Operations research / Mathematical optimization / Search algorithms / NP-complete problems / Combinatorial optimization / Variable neighborhood search / Vehicle routing problem / Travelling salesman problem / Heuristic / A* search algorithm / Lagrangian relaxation / Local search Operations research / Mathematical optimization / Search algorithms / NP-complete problems / Combinatorial optimization / Variable neighborhood search / Vehicle routing problem / Travelling salesman problem / Heuristic / A* search algorithm / Lagrangian relaxation / Local search](https://www.pdfsearch.io/img/bb0bd8cbf700b80b941849a206630ccb.jpg) Date: 2010-05-18 03:15:30Operations research Mathematical optimization Search algorithms NP-complete problems Combinatorial optimization Variable neighborhood search Vehicle routing problem Travelling salesman problem Heuristic A* search algorithm Lagrangian relaxation Local search | | Combining Constraint Programming, Lagrangian Relaxation and Probabilistic Algorithms to solve the Vehicle Routing Problem Daniel Guimarans1 , Rosa Herrero1 , Daniel Riera2 , Angel A. Juan2 , and Juan Jos´e Ramos1 1Add to Reading ListSource URL: ceur-ws.orgDownload Document from Source Website File Size: 175,71 KBShare Document on Facebook
|