A heuristic approach to hard constrained shortest path problems
Authors:
- Celso C. RibeiroCRCelso C. Ribeiro
- Michel MinouxMMMichel Minoux
- 28 February 1985
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 10 (2) , 125-137
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- A transformation of hard (equality constrained) knapsack problems into constrained shortest path problemsOperations Research Letters, 1984
- Parametric shortest path algorithms with an application to cyclic staffingDiscrete Applied Mathematics, 1981
- A dual algorithm for the constrained shortest path problemNetworks, 1980
- Plus court chemin avec contraintes : Algorithmes et applicationsAnnals of Telecommunications, 1975
- Shortest path with time constraints on movement and parkingNetworks, 1974
- Letter to the Editor—A Constrained Shortest Route ProblemOperations Research, 1968
- The shortest route problem with constraintsJournal of Mathematical Analysis and Applications, 1966
- Generalized Lagrange Multiplier Method for Solving Problems of Optimum Allocation of ResourcesOperations Research, 1963