✦ LIBER ✦

Online traveling salesman problem with deadline and advanced information

✍ Scribed by Xingang Wen; Yinfeng Xu; Huili Zhang

Book ID: 118430161
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 377 KB
Volume: 63
Category: Article
ISSN: 0360-8352
DOI: 10.1016/j.cie.2012.07.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Online traveling salesman problem with d

Online traveling salesman problem with deadlines and service flexibility

✍ Wen, Xingang; Xu, Yinfeng; Zhang, Huili 📂 Article 📅 2013 🏛 Springer US 🌐 English ⚖ 506 KB

Probabilistic Traveling Salesman Problem

Probabilistic Traveling Salesman Problem with Deadlines

✍ Campbell, Ann M.; Thomas, Barrett W. 📂 Article 📅 2008 🏛 INFORMS 🌐 English ⚖ 205 KB

Online traveling salesman problems with

Online traveling salesman problems with service flexibility

✍ 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

On the computational complexity of the P

On the computational complexity of the Probabilistic Traveling Salesman Problem with Deadlines

✍ Weyland, D. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 871 KB

The traveling salesman problem with cumu

The traveling salesman problem with cumulative costs

✍ Lucio Bianco; Aristide Mingozzi; Salvatore Ricciardelli 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 634 KB

The traveling salesman problem with deli

The traveling salesman problem with delivery and backhauls

✍ Shoshana Anily; Gur Mosheiov 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 541 KB