Using decomposition to improve greedy solutions of the optimal diversity management problem
Year of publication: |
2013
|
---|---|
Authors: | Agra, Agostinho ; Cerdeira, Jorge Orestes ; Requejo, Cristina |
Published in: |
International transactions in operational research : ITOR ; a journal of the International Federation of Operational Research Societies (IFORS). - Oxford : Wiley, ISSN 0969-6016, ZDB-ID 1213721-2. - Vol. 20.2013, 5, p. 617-625
|
Subject: | location problems | p-median | integer programming | heuristics | Mathematische Optimierung | Mathematical programming | Diversity Management | Diversity management | Ganzzahlige Optimierung | Integer programming | Betriebliche Standortwahl | Firm location choice | Heuristik | Heuristics | Theorie | Theory |
-
Local search heuristics for the mobile facility location problem
Halper, Russell, (2015)
-
Exact and approximate heuristics for the rectilinear Weber location problem with a line barrier
Amiri-Aref, Mehdi, (2021)
-
Branch and bound algorithms for solving the multi-commodity capacitated multi-facility Weber problem
Akyüz, M. Hakan, (2019)
- More ...
-
Using decomposition to improve greedy solutions of the optimal diversity management problem
Agra, Agostinho, (2013)
-
A decomposition approach for the p-median problem on disconnected graphs
Agra, Agostinho, (2017)
-
Comparing techniques for modelling uncertainty in a maritime inventory routing problem
Rodrigues, Filipe, (2019)
- More ...