Sciweavers

594 search results - page 26 / 119
» Travelling Miser Problem
Sort
View
DISOPT
2006
110views more  DISOPT 2006»
13 years 7 months ago
New facets of the STS polytope generated from known facets of the ATS polytope
While it was known for a long time how to transform an asymmetric traveling salesman problem on the complete graph with n vertices into a symmetric traveling salesman problem on a...
Egon Balas, Robert Carr, Matteo Fischetti, Neil Si...
ICRA
2010
IEEE
119views Robotics» more  ICRA 2010»
13 years 6 months ago
Evader surveillance under incomplete information
— This paper is concerned with determining whether a mobile robot, called the pursuer, is up to maintaining visibility of an antagonist agent, called the evader. This problem, a ...
Israel Becerra, Rafael Murrieta-Cid, Raul Monroy
TRANSCI
2010
80views more  TRANSCI 2010»
13 years 6 months ago
Congestion Pricing for Schedule-Based Transit Networks
In this paper, we develop models for adjusting or setting fares on a transit system to encourage passengers to choose travel strategies that lead to the least travel delay for the...
Younes Hamdouch, Siriphong Lawphongpanich
OL
2010
128views more  OL 2010»
13 years 6 months ago
A biased random-key genetic algorithm for road congestion minimization
One of the main goals in transportation planning is to achieve solutions for two classical problems, the traffic assignment and toll pricing problems. The traffic assignment proble...
Luciana S. Buriol, Michael J. Hirsch, Panos M. Par...
WADS
2007
Springer
189views Algorithms» more  WADS 2007»
14 years 1 months ago
35/44-Approximation for Asymmetric Maximum TSP with Triangle Inequality
We describe a new approximation algorithm for the asymmetric maximum traveling salesman problem (ATSP) with triangle inequality. Our algorithm achieves approximation factor 35/44 ...
Lukasz Kowalik, Marcin Mucha