Shortest Path Problem with Cache-Dependent Path Lengths
Here, we are motivated by the problem of finding the shortest path in a network when traversing Web pages where cache size determines path length. The shortest path problem with cache-dependent path lengths is shown to be NP-complete. It is a new problem for which we propose several effective heuris...
Saved in:
Main Authors: | FU, Z., Kurnia, A., LIM, Andrew, RODRIGUES, Brian |
---|---|
Format: | text |
Language: | English |
Published: |
Institutional Knowledge at Singapore Management University
2003
|
Subjects: | |
Online Access: | https://ink.library.smu.edu.sg/lkcsb_research/2064 https://doi.org/10.1109/CEC.2003.1299437 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Singapore Management University |
Language: | English |
Similar Items
-
Shortest path problem with cache dependent path lengths
by: Fu, Z., et al.
Published: (2016) -
Tabu Search Embedded Simulated Annealing for the Shortest Route Cut and Fill Problem
by: LIM, Andrew, et al.
Published: (2005) -
The General Yard Allocation Problem
by: CHEN, Ping, et al.
Published: (2003) -
A New Heuristic Method for the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2003) -
A Centroid-Based Approach to Solve the Bandwidth Minimization Problem
by: LIM, Andrew, et al.
Published: (2004)