✦ LIBER ✦

Dynamic programming based metaheuristics for the dial-a-ride problem

✍ Scribed by Ritzinger, Ulrike; Puchinger, Jakob; Hartl, Richard F.

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel Tabu search heuristics for the

✍ Andrea Attanasio; Jean-François Cordeau; Gianpaolo Ghiani; Gilbert Laporte 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 203 KB

Local search heuristics for the probabil

✍ Ho, Sin C. (author);Haugland, Dag (author) 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 385 KB

Local search heuristics for the probabil

✍ Ho, Sin C. (author);Haugland, Dag (author) 📂 Article 📅 2009 🏛 Springer 🌐 German ⚖ 385 KB

A rejected-reinsertion heuristic for the

✍ Ying Luo; Paul Schonfeld 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 237 KB

A Granular Tabu Search algorithm for the

✍ Kirchler, Dominik; Wolfler Calvo, Roberto 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 998 KB

A Branch-and-Cut Algorithm for the Dial-

✍ Cordeau, Jean-François 📂 Article 📅 2006 🏛 INFORMS 🌐 English ⚖ 276 KB