Date: 2012-10-30 16:43:40Computational 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, FranceDocument is deleted from original location. Use the Download Button below to download from the Web Archive.Download Document from Web Archive File Size: 171,51 KB |