Plus court chemin avec contraintes : Algorithmes et applications
- 1 November 1975
- journal article
- research article
- Published by Springer Nature in Annals of Telecommunications
- Vol. 30 (11-12) , 383-394
- https://doi.org/10.1007/bf03004231
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Optimal expansion of an existing networkMathematical Programming, 1974
- Validation of subgradient optimizationMathematical Programming, 1974
- Constructive Duality in Integer ProgrammingSIAM Journal on Applied Mathematics, 1974
- Steepest Ascent for Large Scale Linear ProgramsSIAM Review, 1972
- Finding the Lengths of All Shortest paths in N -Node Nonnegative-Distance Complete Networks Using ½
N
3
Additions and
N
3
ComparisonsJournal of the ACM, 1972
- An Appraisal of Some Shortest-Path AlgorithmsOperations Research, 1969
- Revised Matrix Algorithms for Shortest PathsSIAM Journal on Applied Mathematics, 1967
- The shortest route problem with constraintsJournal of Mathematical Analysis and Applications, 1966
- Theorie des graphes et ses Applications.The American Mathematical Monthly, 1961
- A note on two problems in connexion with graphsNumerische Mathematik, 1959