Ahuja, Ravindra K. and Orlin, James B. and Pallottino, Stefano and Scutellà, Maria Grazia (1999) Minimum time and minimum cost path problems in street networks with traffic lights. Technical Report del Dipartimento di Informatica . Università di Pisa, Pisa, IT.
Postscript (GZip) - Published Version Available under License Creative Commons Attribution No Derivatives. Download (100Kb) |
Official URL: http://compass2.di.unipi.it/TR/files/TR-99-13.ps.g...
Abstract
We shall investigate minimum time and minimum cost path problems in street networks regulated by traffic lights. We shall show that the minimum time path problem is polynomially solvable. On the other hand, in general minimum cost path problems are NP-hard. Particular but realistic cases which are polynomially solvable will be discussed.
Item Type: | Book |
---|---|
Uncontrolled Keywords: | minimum cost paths, transportation |
Subjects: | Area01 - Scienze matematiche e informatiche > INF/01 - Informatica |
Divisions: | Dipartimenti (until 2012) > DIPARTIMENTO DI INFORMATICA |
Depositing User: | dott.ssa Sandra Faita |
Date Deposited: | 27 Jan 2015 09:53 |
Last Modified: | 27 Jan 2015 09:53 |
URI: | http://eprints.adm.unipi.it/id/eprint/2016 |
Repository staff only actions
View Item |