Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces

DOI10.1287/moor.18.1.51zbMath0777.90048OpenAlexW2081768348MaRDI QIDQ4697083

Patrick Jaillet

Publication date: 29 June 1993

Published in: Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/990d6cd045271d4b965f602c3e36af271638a649

zbMATH Keywords

limit theoremsprobabilistic combinatorial optimizationprobabilistic traveling salesmanfinite-size boundsprobabilistic minimum spanning tree

Mathematics Subject Classification ID

Stochastic programming (90C15) Stochastic network models in operations research (90B15) Combinatorial optimization (90C27)

Related Items (4)

A survey on combinatorial optimization in dynamic environments ⋮ The probabilistic orienteering problem ⋮ On properties of geometric random problems in the plane ⋮ Solving the probabilistic TSP with ant colony optimization

This page was built for publication: Analysis of Probabilistic Combinatorial Optimization Problems in Euclidean Spaces