✦ LIBER ✦

The orienteering problem

✍ Scribed by Bruce L. Golden; Larry Levy; Rakesh Vohra

Publisher: John Wiley and Sons
Year: 1987
Tongue: English
Weight: 467 KB
Volume: 34
Category: Article
ISSN: 0894-069X
DOI: 10.1002/1520-6750(198706)34:3<307::aid-nav3220340302>3.0.co;2-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The team orienteering problem

✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 629 KB

A multifaceted heuristic for the oriente

A multifaceted heuristic for the orienteering problem

✍ B. L. Golden; Qiwen Wang; Li Liu 📂 Article 📅 1988 🏛 John Wiley and Sons 🌐 English ⚖ 451 KB

Algorithms to solve the orienteering pro

Algorithms to solve the orienteering problem: A comparison

✍ C.Peter Keller 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 582 KB

Strong linear programming relaxations fo

Strong linear programming relaxations for the orienteering problem

✍ Adrienne C. Leifer; Moshe B. Rosenwein 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 481 KB

A fast and effective heuristic for the o

A fast and effective heuristic for the orienteering problem

✍ I-Ming Chao; Bruce L. Golden; Edward A. Wasil 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 955 KB

Approximation algorithms for time-depend

Approximation algorithms for time-dependent orienteering

✍ Fedor V. Fomin; Andrzej Lingas 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 73 KB

The time-dependent orienteering problem is dual to the time-dependent traveling salesman problem. It consists of visiting a maximum number of sites within a given deadline. The traveling time between two sites is in general dependent on the starting time. For any ε > 0, we provide a (2 + ε)-approxi