New bound-tightening algorithms and Givens-rotation symmetry separation for MINLPs with minimum distance constraints are proposed and compared in computational experiments.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.OC 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A computational comparison of handling distance constraints in MINLP
New bound-tightening algorithms and Givens-rotation symmetry separation for MINLPs with minimum distance constraints are proposed and compared in computational experiments.