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...
Saved in:
| Main Authors: | , |
|---|---|
| 格式: | text |
| 語言: | English |
| 出版: |
Institutional Knowledge at Singapore Management University
2013
|
| 主題: | |
| 在線閱讀: | https://ink.library.smu.edu.sg/sis_research/1823 https://ink.library.smu.edu.sg/context/sis_research/article/2822/viewcontent/SSTD13_BUP.pdf |
| 標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|