A computational comparison of handling distance constraints in MINLP
Open Access
- 15 September 2026
- journal article
- Published by Elsevier in Operations Research Letters
- Vol. 70
Abstract
No abstract availableAll Related Versions
Funding Information
- Anthony Nolan Research Institute (ANR-24-CE23-1621)
This publication has 23 references indexed in Scilit:
- Simultaneous convexification for the planar obnoxious facility location problemJournal of Global Optimization, 2025
- A unified framework for symmetry handlingMathematical Programming, 2024
- On tackling reverse convex constraints for non-overlapping of unequal circlesJournal of Global Optimization, 2021
- A computational comparison of symmetry handling methods for mixed integer programsMathematical Programming Computation, 2018
- Orbital branchingMathematical Programming, 2009
- Packing and partitioning orbitopesMathematical Programming, 2007
- A Reliable Area Reduction Technique for Solving Circle Packing ProblemsComputing, 2006
- On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programmingMathematical Programming, 2005
- Pruning by isomorphism in branch-and-cutMathematical Programming, 2002
- Benchmarking optimization software with performance profilesMathematical Programming, 2002