Approximation algorithm for the stochastic prize-collecting set multicover problem.
Yotaro TakazawaPublished in: Oper. Res. Lett. (2022)
Keyphrases
- learning algorithm
- monte carlo
- np hard
- cost function
- optimization algorithm
- discrete random variables
- initial set
- prize collecting
- input data
- objective function
- approximation algorithms
- worst case
- computational complexity
- computational efficiency
- k means
- convex hull
- lower and upper bounds
- combinatorial optimization
- image sequences
- error tolerance
- polygonal approximation
- single machine scheduling problem
- search strategy
- lower bound
- expectation maximization
- simulated annealing
- dynamic programming
- search space