Solving Euclidean Max-Sum problems exactly with cutting planes
We solve one of the most challenging optimisation problems in the literature. The new technique that we created can be used in nonlinear scheduling optimisation models in industry.
Publication: Computers & Operations Research
DOI: 10.1016/j.cor.2024.106682