Best Upgrade Plans for Large Road Networks

Best Upgrade Plans for Large Road Networks

In this paper, we consider a new problem in the context of road network databases, named Resource Constrained Best Upgrade Plan computation (BUP, for short). Consider a transportation network (weighted graph) G where a subset of the edges are upgradable, i.e., for each such edge there is a cost, whi...

Full description

Saved in:
Bibliographic Details
Main Authors: LIN, Yimin, MOURATIDIS, Kyriakos
Format: text
Language:English
Published: Institutional Knowledge at Singapore Management University 2013
Subjects:
Real road networks
Resource Constraint
Road network
Shortest path
Transportation network
Weighted graph
Databases and Information Systems
Numerical Analysis and Scientific Computing
Transportation
Online Access:https://ink.library.smu.edu.sg/sis_research/1823
https://ink.library.smu.edu.sg/context/sis_research/article/2822/viewcontent/SSTD13_BUP.pdf
Tags: Add Tag
No Tags, Be the first to tag this record!
Institution: Singapore Management University
Language: English

Internet

https://ink.library.smu.edu.sg/sis_research/1823
https://ink.library.smu.edu.sg/context/sis_research/article/2822/viewcontent/SSTD13_BUP.pdf

Similar Items