Probabilistic optimization in graph-problems

zbMATH Open1277.90118MaRDI QIDQ2865853FDOQ2865853

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

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

zbMATH Keywords

complexityapproximationgraph problem

Mathematics Subject Classification ID

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

Cited In (10)

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

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)