Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Körkel-Ghosh instances.
Daniel KarapetyanBoris GoldengorinPublished in: CoRR (2017)
Keyphrases
- markov chain
- upper bound
- steady state
- finite state
- lower and upper bounds
- markov model
- transition probabilities
- random walk
- stationary distribution
- search algorithm
- state space
- monte carlo
- markov process
- monte carlo simulation
- monte carlo method
- lower bound
- search space
- transition matrix
- markov chain monte carlo
- vc dimension
- bayesian framework