A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem

Michael Hellwig, Hans-Georg Beyer. A Linear Constrained Optimization Benchmark for Probabilistic Search Algorithms: The Rotated Klee-Minty Problem. In David Fagan, Carlos Martín-Vide, Michael O'Neill 0001, Miguel A. Vega-Rodríguez, editors, Theory and Practice of Natural Computing - 7th International Conference, TPNC 2018, Dublin, Ireland, December 12-14, 2018, Proceedings. Volume 11324 of Lecture Notes in Computer Science, pages 139-151, Springer, 2018. [doi]

Abstract

Abstract is missing.