An exact cutting plane method for the Euclidean max-sum diversity problem
Year of publication: |
2023
|
---|---|
Authors: | Spiers, Sandy ; Bui, Hoa T. ; Loxton, Ryan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 311.2023, 2 (1.12.), p. 444-454
|
Subject: | Combinatorial optimization | Maximum diversity | Cutting planes | Euclidean distance | Branch and cut | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Ganzzahlige Optimierung | Integer programming | Scheduling-Verfahren | Scheduling problem | Branch-and-Bound | Branch and Bound |
-
Some new clique inequalities in four-index hub location models
Landete, Mercedes, (2024)
-
Machine learning for combinatorial optimization : a methodological tour d'horizon
Bengio, Yoshua, (2021)
-
Upper and lower bounding procedures for the multiple knapsack assignment problem
Kataoka, Seiji, (2014)
- More ...
-
Solving Euclidean Max-Sum problems exactly with cutting planes
Bui, Hoa T., (2024)
-
A note on the finite convergence of alternating projections
Bui, Hoa T., (2021)
-
Bilinear branch and check for unspecified parallel machine scheduling with shift consideration
Jartnillaphand, Ponpot, (2025)
- More ...