Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Korkel-Ghosh instances
by Daniel Karapetyan, Boris Goldengorin
Reference:
Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Korkel-Ghosh instances (Daniel Karapetyan, Boris Goldengorin), chapter in Optimization Problems in Graph Theory (Boris Goldengorin, ed.), 123–147, Springer, 2018.
Bibtex Entry:
@InCollection{SPLP-CMCS,
author = {Daniel Karapetyan and Boris Goldengorin},
title = {Conditional Markov Chain Search for the Simple Plant Location Problem improves upper bounds on twelve Korkel-Ghosh instances},
booktitle = {Optimization Problems in Graph Theory},
publisher = {Springer},
year = {2018},
editor = {Boris Goldengorin},
pages = {123--147},
arxivid = {1711.06347},
comment = {[<a href="http://www.cs.nott.ac.uk/~pszdk/splp-source-and-solutions.zip">Source codes and solutions</a>]},
}