Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems

Rickard Karlsson, Laurens Bliek, Sicco Verwer, Mathijs de Weerdt. Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems. In Mitra Baratchi, Lu Cao, Walter A. Kosters, Jefrey Lijffijt, Jan N. van Rijn, Frank W. Takes, editors, Artificial Intelligence and Machine Learning - 32nd Benelux Conference, BNAIC/Benelearn 2020, Leiden, The Netherlands, November 19-20, 2020, Revised Selected Papers. Volume 1398 of Communications in Computer and Information Science, pages 48-63, Springer, 2020. [doi]

@inproceedings{KarlssonBVW20,
  title = {Continuous Surrogate-Based Optimization Algorithms Are Well-Suited for Expensive Discrete Problems},
  author = {Rickard Karlsson and Laurens Bliek and Sicco Verwer and Mathijs de Weerdt},
  year = {2020},
  doi = {10.1007/978-3-030-76640-5_4},
  url = {https://doi.org/10.1007/978-3-030-76640-5_4},
  researchr = {https://researchr.org/publication/KarlssonBVW20},
  cites = {0},
  citedby = {0},
  pages = {48-63},
  booktitle = {Artificial Intelligence and Machine Learning - 32nd Benelux Conference, BNAIC/Benelearn 2020, Leiden, The Netherlands, November 19-20, 2020, Revised Selected Papers},
  editor = {Mitra Baratchi and Lu Cao and Walter A. Kosters and Jefrey Lijffijt and Jan N. van Rijn and Frank W. Takes},
  volume = {1398},
  series = {Communications in Computer and Information Science},
  publisher = {Springer},
  isbn = {978-3-030-76640-5},
}