Lagrangian relaxation and enumeration for solving constrained shortest‐path problems
- 9 April 2008
- Vol. 52 (4), 256-270
- https://doi.org/10.1002/net.20247
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Near-shortest and K-shortest simple pathsNetworks, 2005
- Concepts of Exact QoS Routing AlgorithmsIEEE/ACM Transactions on Networking, 2004
- Performance evaluation of constraint-based path selection algorithmsIEEE Network, 2004
- An efficient algorithm for finding a path subject to two additive constraintsComputer Communications, 2002
- A rate distortion optimal ECG coding algorithmIEEE Transactions on Biomedical Engineering, 2001
- An efficient implementation of an algorithm for findingK shortest simple pathsNetworks, 1999
- FASTEST PATHS IN TIME-DEPENDENT NETWORKS FOR INTELLIGENT VEHICLE-HIGHWAY SYSTEMS APPLICATION∗I V H S Journal, 1993
- Algorithms for finding paths with multiple constraintsNetworks, 1984
- Shortest chain subject to side constraintsNetworks, 1983
- A dual algorithm for the constrained shortest path problemNetworks, 1980