A computational comparison of handling distance constraints in MINLP

Minimum distance constraints (minDCs) appear in many geometric optimization problems. They pose major challenges for mixed-integer nonlinear programming (MINLP) due to their reverse-convexity. We develop new algorithms for tightening variable bounds in general MINLPs with minDCs. Because many such problems exhibit substantial symmetry, we further discuss an approach for handling rotation symmetries. In a computational study, we examine the performance of the various methods and determine the scenarios in which each approach demonstrates superiority.