News from the online traveling repairman
β Scribed by Sven O. Krumke; Willem E. de Paepe; Diana Poensgen; Leen Stougie
- Publisher
- Elsevier Science
- Year
- 2003
- Tongue
- English
- Weight
- 241 KB
- Volume
- 295
- Category
- Article
- ISSN
- 0304-3975
No coin nor oath required. For personal study only.
β¦ Synopsis
In the traveling repairman problem (TRP), a tour must be found through every one of a set of points (cities) in some metric space such that the weighted sum of completion times of the cities is minimized. Given a tour, the completion time of a city is the time traveled on the tour before the city is reached. In the online traveling repairman problem (OLTRP) requests for visits to cities arrive online while the repairman is traveling. We analyze the performance of algorithms for the * Corresponding author.
π SIMILAR VOLUMES
The Internet and new technologies are changing the information behavior of news readers. This study explored the perception of news and online news reading behavior by applying Savolainen's (1995) model of Everyday Life Information Seeking. Online news readers participated in a two-phase mixed metho
## Abstract This paper investigates how consumers' shopping orientation toward travel shopping influences their tendency to shop for travel products on the Internet. The paper also looks into the role of consumers' travel experience. A conceptual model is developed and a number of hypotheses are fo
This study examines the importance of trust in an online accommodation booking relationship. Specifically, the study seeks to identify the trust criteria that are important to consumers in deciding whether to purchase online and also the trust criteria that the accommodation service providers (i.e.