Vertex-Uncertainty in Graph-Problems
From MaRDI portal
Publication:5505652
DOI10.1007/978-3-540-85097-7_13zbMATH Open1168.90591OpenAlexW1865859639MaRDI QIDQ5505652FDOQ5505652
Authors: C. Murat, Vangelis Th. Paschos
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
Recommendations
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Stochastic programming (90C15)
Cites Work
- Title not available (Why is that?)
- Probabilistic a priori routing-location problems
- Traveling Salesman Facility Location Problems
- A Priori Optimization
- The probabilistic minimum spanning tree problem
- The Probabilistic Minimum Vertex-covering Problem
- Local search for the probabilistic traveling salesman problem: correction to the 2-p-opt and 1-shift algorithms
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
- Title not available (Why is that?)
- Probabilistic combinatorial optimization problems on graphs: A new domain in operational research
- On the probabilistic minimum coloring and minimum \(k\)-coloring
- Shortest path problems with node failures
- The probabilistic longest path problem
- A priori optimization for the probabilistic maximum independent set problem
- Probabilistic graph-coloring in bipartite and split graphs
- Probabilistic Combinatorial Optimization on Graphs
- Steiner Forests on Stochastic Metric Graphs
Cited In (2)
This page was built for publication: Vertex-Uncertainty in Graph-Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5505652)