Probabilistic optimization in graph-problems

MaRDI QIDQ2865853zbMATH OpenFDO

Authors C. Murat, Vangelis Th. Paschos

Publication date 11 December 2013

Published in Algorithmic Operations Research (Search for Journal in Brave)

Full work available at URL http://journals.hil.unb.ca/index.php/AOR/article/view/11267

zbMATH Keywords

approximationcomplexitygraph problem

Mathematics Subject Classification ID

Hypergraphs (05C65) Graph algorithms (graph-theoretic aspects) (05C85) Stochastic programming (90C15) Combinatorial optimization (90C27)

Recommendations

• Vertex-Uncertainty in Graph-Problems
• Probabilistic Combinatorial Optimization on Graphs
• The Probabilistic Minimum Vertex-covering Problem
• Probabilistic combinatorial optimization
• On the probabilistic min spanning tree problem

Cited in

(10)

• A probabilistic paradigm for handling uncertain objects in GIS by randomized graph algebra.
• Probabilistic graph programs for randomised and evolutionary algorithms
• Uncertain graph and network optimization
• Probabilistic pursuits on graphs
• A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
• scientific article; zbMATH DE number 558545 (Why is no real title available?)
• Methodology for Stochastic Graph Completion-Time Problems
• Vertex-Uncertainty in Graph-Problems
• Probabilistic decision graphs for optimization under uncertainty
• Optimization Problems in Graphs with Locational Uncertainty

This page was built for publication: Probabilistic optimization in graph-problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2865853)