Probabilistic Combinatorial Optimization on Graphs

DOI10.1002/9780470612507MaRDI QIDQ3426051zbMATH OpenOpenAlexFDO

Authors C. Murat, Vangelis Th. Paschos

Publication date 7 March 2007

Full work available at URL https://doi.org/10.1002/9780470612507

zbMATH Keywords

graphscombinatorial optimizationstochastic optimizationcomplexity theory

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Stochastic programming (90C15) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Combinatorial probability (60C05)

Recommendations

• A priori optimization for the probabilistic maximum independent set problem
• Probabilistic combinatorial optimization
• scientific article; zbMATH DE number 1330075
• scientific article; zbMATH DE number 844506
• A Priori Optimization

Cited in

(9)

• Vertex-Uncertainty in Graph-Problems
• A survey on combinatorial optimization in dynamic environments
• scientific article; zbMATH DE number 1857640 (Why is no real title available?)
• A Generic Algorithm for Approximately Solving Stochastic Graph Optimization Problems
• scientific article; zbMATH DE number 2169759 (Why is no real title available?)
• Polynomial approximation: a structural and operational study. (Abstract of thesis)
• Probabilistic graph programs for randomised and evolutionary algorithms
• Probabilistic combinatorial optimization
• Probabilistic optimization in graph-problems

This page was built for publication: Probabilistic Combinatorial Optimization on Graphs

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