Vertex-Uncertainty in Graph-Problems

DOI10.1007/978-3-540-85097-7_13zbMath1168.90591OpenAlexW1865859639MaRDI QIDQ5505652

Vangelis Th. Paschos, Cécile Murat

Publication date: 27 January 2009

Published in: Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85097-7_13

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
• Probabilistic graph-coloring in bipartite and split graphs
• Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
• On the probabilistic minimum coloring and minimum \(k\)-coloring
• Probabilistic Combinatorial Optimization on Graphs
• The probabilistic minimum spanning tree problem
• Steiner Forests on Stochastic Metric Graphs
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• Shortest path problems with node failures
• The probabilistic longest path problem
• Probabilistic a priori routing-location problems
• The Probabilistic Minimum Vertex-covering Problem
• Traveling Salesman Facility Location Problems
• A Priori Optimization
• A priori optimization for the probabilistic maximum independent set problem

This page was built for publication: Vertex-Uncertainty in Graph-Problems