Solving the maximum min-sum dispersion by alternating formulations of two different problems
Year of publication: |
16 July 2017
|
---|---|
Authors: | Amirgaliyeva, Zhazira ; Mladenovic, Nenad ; Todosijević, Raca ; Urošević, Dragan |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 260.2017, 2 (16.7.), p. 444-459
|
Subject: | Metaheuristics | Dispersion problems | Binary quadratic programing | Variable neighborhood search | Variable formulation search | Mathematische Optimierung | Mathematical programming | Heuristik | Heuristics | Scheduling-Verfahren | Scheduling problem | Suchtheorie | Search theory |
-
Effective metaheuristic algorithms for the minimum differential dispersion problem
Wang, Yang, (2017)
-
MaxMinMin p-dispersion problem : a variable neighborhood search approach
Saboonchi, Behnaz, (2014)
-
Nagataa, Yuichi, (2018)
- More ...
-
Solving the capacitated clustering problem with variable neighborhood search
Brimberg, Jack, (2019)
-
Mladenovic, Nenad, (2022)
-
Solving multifacility Huff location models on networks using metaheuristic and exact approaches
Grohmann, Sanja, (2017)
- More ...