Computing diverse solutions to optimization problems
This paper considers the problem of computing a pool of near-optimal solutions to a given optimization problem while maximizing their total pairwise distance, and focuses on Mixed-Integer Linear Programming problems where a subset of variables are binary and consider the Hamming distance over these variables.
Enrico Malaguti, Michele Monaci, P. Paronuzzi
· 0 citations