The probabilistic longest path problem

Networks

Volumn 33, Issue 3, 1999, Pages 207-219

  Murat, Cécile ^a   Paschos, Vangelis Th ^a  

^a UNIVERSITÉ PARIS DAUPHINE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033130512     PISSN: 00283045     EISSN: None     Source Type: Journal    
DOI: 10.1002/(SICI)1097-0037(199905)33:3<207::AID-NET7>3.0.CO;2-7     Document Type: Article

References (10)

1. [1] M. Bellalouna, Problèmes d'optimisation combinatoires probabilistes, Ph.D. Thesis, Centre de Recherche en Mathématiques Appliquées, Ecole Nationale des Ponts et Chaussées, Paris, France, 1993.
2. [2] M. Bellalouna, C. Murat, and V.Th. Paschos, Probabilistic combinatorial optimization problems: A new domain in operational research, Eur J Oper Res 87 (1995), 693-706.
3. [3] D.J. Bertsimas, Probabilistic combinatorial optimization problems, Ph.D. Thesis, Operations Research Center, MIT, Cambridge, MA, 1988.
4. [4] D.J. Bertsimas, P. Jaillet, and A. Odoni, A priori optimization, Oper Res 38 (1990), 1019-1033.
5. [5] Y. Bjornsson, L. Stewart, and B. Xu, Comparability graph page, available on www_address: http://www.cs.ualberta. ca/~bing/GRAPH/comparability, 1997.
6. [6] Y. Cai and M.C. Kong, Generation of all maximal cliques and related problems for certain perfect graphs, Congr Numer 90 (1992), 33-55.
7. [7] V. Gabrel, A. Moulet, C. Murat, and V. Th. Paschos, A new single model and derived algorithms for the satellite shot planning problem using graph theory concepts, Ann Oper Res 69 (1997), 115-134.
8. [8] M.R. Garey and D.S. Johnson, Computers and intractability. A guide to the theory of NP-completeness, W.H. Freeman, San Francisco, CA, 1979.
9. [9] P. Jaillet, Shortest path problems with node failures, Networks 22 (1992), 589-605.
10. [10] C. Murat and V.Th. Paschos, The probabilistic maximum independent set problem, Proc Applied Stochastic Models and Data Analysis, 1995, pp. 420-429.