Back to Results
First PageMeta Content
Computational complexity theory / Travelling salesman problem / Linear programming / Optimization problem / Mathematical optimization / Constraint programming / Shortest path problem / Theoretical computer science / Mathematics / Operations research


Global and reactive routing in urban context: first experiments / first difficulty assessment Pen´elope A. Melgarejo IBM, France Thomas Baudel IBM, France
Add to Reading List

Document Date: 2012-10-30 16:43:40

Open Document

File Size: 171,51 KB

Share Result on Facebook

City

Lyon / /

Company

IBM / Princeton University Press / LARGE AND COMPLEX NETWORKS / /

IndustryTerm

search phases / route planning algorithms / travel times / car accidents / search space / predicted travel times / /

Organization

Princeton University / Universidad de Buenos Aires / /

Person

Miranda Bront / Michel Rueher / Jan van Hoeve / Louis-Martin Rousseau / Dominik Schultes / Dorothea Wagner / Daniel Delling / Pascal Benchimol / Juan Jos / Peter Sanders / Thomas Baudel / Christine Solnon / /

Position

salesman / Time Dependent Travelling Salesman / Time-Dependent Traveling Salesman / /

ProgrammingLanguage

TSP / /

PublishedMedium

LECTURE NOTES IN COMPUTER SCIENCE / /

Technology

Engineering route planning algorithms / Time-Dependent Dijkstra algorithm / /

URL

www.optimodlyon.com / /

SocialTag