Skip to main content
The ARC Training Centre for
Transforming Maintenance through Data Science
Publications

Solving Euclidean Max-Sum problems exactly with cutting planes

Hoa T Bui, Sandy Spiers and Ryan Loxton

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