A dual algorithm for the constrained shortest path problem
- 1 December 1980
- Vol. 10 (4), 293-309
- https://doi.org/10.1002/net.3230100403
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Generalized Linear Programming Solves the DualManagement Science, 1976
- OPTIMIZATION FOR SPARSE SYSTEMSPublished by Elsevier BV ,1976
- Iterative methods for determining the k shortest paths in a networkNetworks, 1976
- On the Computational Complexity of Combinatorial ProblemsNetworks, 1975
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Lagrangean relaxation for integer programmingPublished by Springer Science and Business Media LLC ,1974
- Finding the K Shortest Loopless Paths in a NetworkManagement Science, 1971
- The shortest route problem with constraintsJournal of Mathematical Analysis and Applications, 1966
- ON THE RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMSProceedings of the National Academy of Sciences of the United States of America, 1965
- A note on two problems in connexion with graphsNumerische Mathematik, 1959