Probabilistic combinatorial optimization problems on graphs: A new domain in operational research

DOI10.1016/0377-2217(95)00240-5MaRDI QIDQ1390342zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

heuristicsgraph theoryindependent settraveling salesmanprobabilistic combinatorial optimization

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Stochastic programming (90C15)

Recommendations

• Probabilistic combinatorial optimization
• scientific article; zbMATH DE number 844506
• Probabilistic Combinatorial Optimization on Graphs
• scientific article; zbMATH DE number 4137536

Cites work

• scientific article; zbMATH DE number 3898613 (Why is no real title available?)
• scientific article; zbMATH DE number 3904630 (Why is no real title available?)
• scientific article; zbMATH DE number 4066604 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A Priori Optimization
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• A characterization of linear admissible transformations for the m- travelling salesmen problem
• A priori optimization for the probabilistic maximum independent set problem
• Bounds and Heuristics for Capacitated Routing Problems
• Shortest path problems with node failures
• Subadditive Euclidean functionals and nonlinear growth in geometric probability
• The probabilistic minimum spanning tree problem
• Traveling Salesman Facility Location Problems

Cited in

(4)

• Probabilistic pursuits on graphs
• Probabilistic graph-coloring in bipartite and split graphs
• Vertex-Uncertainty in Graph-Problems
• Probabilistic combinatorial optimization

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)