Online traveling salesman problems with
β
Patrick Jaillet; Xin Lu
π
Article
π
2011
π
John Wiley and Sons
π
English
β 192 KB
## Abstract The traveling salesman problem is a wellβknown combinatorial optimization problem. We are concerned here with online versions of this problem defined on metric spaces. One novel aspect in this article is the introduction of a sound theoretical model to incorporate βyesβnoβ decisions on