Best Upgrade Plans for Large Road Networks

• المؤلفون الرئيسيون: LIN, Yimin, MOURATIDIS, Kyriakos
• التنسيق: text
• اللغة: English
• منشور في: Institutional Knowledge at Singapore Management University 2013
• الموضوعات: Real road networks; Resource Constraint; Road network; Shortest path; Transportation network; Weighted graph; Databases and Information Systems; Numerical Analysis and Scientific Computing; Transportation
• الوصول للمادة أونلاين: https://ink.library.smu.edu.sg/sis_research/1823; https://ink.library.smu.edu.sg/context/sis_research/article/2822/viewcontent/SSTD13_BUP.pdf
• المؤسسة: Singapore Management University

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...