An improved solution algorithm for the constrained shortest path problem
The shortest path problem is one of the classic network problems. The objective of this problem is to identify the least cost path through a network from a pre-determined starting node to a pre-determined terminus node. It has many practical applications and can be solved optimally via efficient alg...
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Language: | eng |
| Published: |
2007
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/10316/3958 |
| Country: | Portugal |
| Oai: | oai:estudogeral.sib.uc.pt:10316/3958 |