Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
From MaRDI portal
Publication:1390342
DOI10.1016/0377-2217(95)00240-5zbMath0915.90213OpenAlexW2014736580MaRDI QIDQ1390342
Cécile Murat, Vangelis Th. Paschos, Monia Bellalouna
Publication date: 5 July 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0377-2217(95)00240-5
Programming involving graphs or networks (90C35) Stochastic programming (90C15) Combinatorial optimization (90C27)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- A characterization of linear admissible transformations for the m- travelling salesmen problem
- The probabilistic minimum spanning tree problem
- Bounds and Heuristics for Capacitated Routing Problems
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Shortest path problems with node failures
- Traveling Salesman Facility Location Problems
- A Priori Optimization
- A priori optimization for the probabilistic maximum independent set problem
This page was built for publication: Probabilistic combinatorial optimization problems on graphs: A new domain in operational research