A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order
Year of publication: |
2023
|
---|---|
Authors: | Cabezas, Xavier ; García, Sergio |
Published in: |
Journal of the Operational Research Society. - London : Taylor and Francis, ISSN 1476-9360, ZDB-ID 2007775-0. - Vol. 74.2023, 11, p. 2391-2402
|
Subject: | Lagrangian relaxation | preferences | semi-Lagrangian relaxation | Simple plant location problem | Betriebliche Standortwahl | Firm location choice | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics | Branch-and-Bound | Branch and Bound | Algorithmus | Algorithm |
-
Rostami, Mohammad, (2020)
-
Gendron, Bernard, (2016)
-
An exact algorithm for the modular hub location problem with single assignments
Tanash, Moayad, (2017)
- More ...
-
A p-median problem with distance selection
Benati, Stefano, (2012)
-
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
García, Sergio, (2012)
-
O’Hanley, Jesse R., (2013)
- More ...