[1] Webpage of the Fourth Max-SAT Evaluation. http://www.maxsat.udl.cat/09/index.php?disp=submitted-benchmarks. Last access: 2023-05-02.
[2] MaxSAT Evaluation 2018: Solver and Benchmark Descriptions. 2018. URL http://hdl.handle.net/10138/237139. Publisher: Department of Computer Science, University of Helsinki.
[3] André Abramé and Djamal Habet. AHMAXSAT: Description and evaluation of a branch and bound Max-SAT solver. Journal on Satisfiability, Boolean Modeling and Computation, 9(1): 89-128, 2014.
[4] Fahiem Bacchus, Matti Järvisalo, and Ruben Martins. MaxSAT Evaluation 2018: New developments and detailed results. Journal on Satisfiability, Boolean Modeling and Computation, 11(1):99-131, 2019.
[5] Maximilian Balandat, Brian Karrer, Daniel R. Jiang, Samuel Daulton, Benjamin Letham, Andrew Gordon Wilson, and Eytan Bakshy. BoTorch: A Framework for Efficient Monte-Carlo Bayesian Optimization. In Advances in Neural Information Processing Systems (NeurIPS), volume 33, 2020.
[6] Ricardo Baptista and Matthias Poloczek. Bayesian optimization of combinatorial structures. In International Conference on Machine Learning, pages 462-471. PMLR, 2018.
[7] Petr Baudiš and Petr Posík. Online Black-Box Algorithm Portfolios for Continuous Optimization. In Parallel Problem Solving from Nature – PPSN XIII, pages 40–49, Cham, 2014. Springer International Publishing.
[8] James Bergstra and Yoshua Bengio. Random Search for Hyper-Parameter Optimization. Journal of Machine Learning Research, 13(2), 2012.
[9] James Bergstra, Rémi Bardenet, Yoshua Bengio, and Balázs Kégl. Algorithms for HyperParameter Optimization. In Advances in Neural Information Processing Systems (NeurIPS), volume 24, 2011.
[10] Mickael Binois and Nathan Wycoff. A survey on high-dimensional Gaussian process modeling with application to Bayesian optimization. ACM Transactions on Evolutionary Learning and Optimization, 2(2):1-26, 2022.
[11] Mickael Binois, David Ginsbourger, and Olivier Roustant. A warped kernel improving robustness in Bayesian optimization via random embeddings. In International Conference on Learning and Intelligent Optimization (LION), pages 281-286. Springer, 2015.
[12] Mickael Boinis, David Ginsbourger, and Olivier Roustant. On the choice of the low-dimensional domain for global optimization via random embeddings. Journal of global optimization, 76(1):69-90, 2020.
[13] Jim Boelrijk, Bernd Ensing, Patrick Forre, and Bob WJ Pirok. Closed-loop automatic gradient design for liquid chromatography using Bayesian optimization. Analytica Chimica Acta, 1242, 2023.
[14] Mohamed Amine Bouhlel, Nathalie Bartoli, Rommel G. Regis, Abdelkader Otsmane, and Joseph Morlier. Efficient global optimization for high-dimensional constrained problems by using the Kriging models combined with the partial least squares method. Engineering Optimization, 50(12):2038-2053, 2018.
[15] Benjamin Burger, Phillip M Maffettone, Vladimir V Gusev, Catherine M Aitchison, Yang Bai, Xiaoyan Wang, Xiaobo Li, Ben M Alston, Buyi Li, Rob Clowes, et al. A mobile robotic chemist. Nature, 583(7815):237-241, 2020.
[16] Roberto Calandra, Nakul Gopalan, André Seyfarth, Jan Peters, and Marc Peter Deisenroth. Bayesian Gait Optimization for Bipedal Locomotion. In Learning and Intelligent Optimization, pages 274-290. Springer International Publishing, 2014.