The Computational Complexity of Stochastic Optimization
Authors:
- 22 July 2014
- book chapter
- Published by Springer Nature
- p. 173-185
Abstract
No abstract availableKeywords
This publication has 6 references indexed in Scilit:
- An Improved Heuristic for the Probabilistic Traveling Salesman Problem with Deadlines Based on GPGPU2013
- Hardness Results for the Probabilistic Traveling Salesman Problem with DeadlinesLecture Notes in Computer Science, 2012
- Computational complexity of stochastic programming problemsMathematical Programming, 2005
- PP Is Closed under Truth-Table ReductionsInformation and Computation, 1996
- A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are VisitedOperations Research, 1988
- The complexity of computing the permanentTheoretical Computer Science, 1979