Probabilistic Combinatorial Optimization on Graphs

From MaRDI portal

Revision as of 18:43, 4 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:3426051

Jump to:navigation, search

DOI10.1002/9780470612507zbMath1119.90033OpenAlexW582096523MaRDI QIDQ3426051

Vangelis Th. Paschos, Cécile Murat

Publication date: 7 March 2007

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

zbMATH Keywords

stochastic optimization combinatorial optimization graphs complexity theory

Mathematics Subject Classification ID

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

Related Items (3)

A survey on combinatorial optimization in dynamic environments ⋮ Polynomial approximation: a structural and operational study. (Abstract of thesis) ⋮ Vertex-Uncertainty in Graph-Problems

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

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3426051&oldid=16727123"