Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
DOI10.1016/0377-2217(95)00240-5zbMATH Open0915.90213OpenAlexW2014736580MaRDI QIDQ1390342FDOQ1390342
Authors: Monia Bellalouna, C. Murat, Vangelis Th. Paschos 
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
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- A characterization of linear admissible transformations for the m- travelling salesmen problem
- Bounds and Heuristics for Capacitated Routing Problems
- Traveling Salesman Facility Location Problems
- Title not available (Why is that?)
- A Priori Optimization
- The probabilistic minimum spanning tree problem
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Title not available (Why is that?)
- Subadditive Euclidean functionals and nonlinear growth in geometric probability
- Shortest path problems with node failures
- A priori optimization for the probabilistic maximum independent set problem
Cited In (4)
This page was built for publication: Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1390342)
