Zobrazeno 1 - 1
of 1
pro vyhledávání: '"J.-F. Raimond"'
Autor:
J.-F. Raimond
Publikováno v:
IBM Journal of Research and Development. 13:391-399
The problem of finding a minimaximal path in a disjunctive network is stated in terms of both graph theory and linear programming with mixed-integer variables. It is solved in both formulations using a "direct search" scheme with additional dynamic f
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d5977d36f84267dab327abd240ae2cf8
https://doi.org/10.1147/rd.134.0391
https://doi.org/10.1147/rd.134.0391
