Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances
From MaRDI portal
Publication:2315579
DOI10.1007/978-3-319-94830-0_7zbMath1418.90140arXiv1711.06347OpenAlexW2768227135MaRDI QIDQ2315579
Daniel Karapetyan, Boris I. Goldengorin
Publication date: 25 July 2019
Full work available at URL: https://arxiv.org/abs/1711.06347
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Markov and semi-Markov decision processes (90C40) Discrete location and assignment (90B80)
This page was built for publication: Conditional Markov Chain search for the simple plant location problem improves upper bounds on twelve Körkel-Ghosh instances
