A Lagrangian-based brand-and-bound algorithm for the two-level uncapacitated facility location problem with single-assignment constraints
Year of publication: |
November 2016
|
---|---|
Authors: | Gendron, Bernard ; Khuong, Paul-Virak ; Semet, Frédéric |
Published in: |
Transportation science : a journal of the Institute for Operations Research and the Management Sciences. - Catonsville, MD : Transportation Science & Logistics Society of the Institute for Operations Research and the Management Sciences, ISSN 0041-1655, ZDB-ID 160958-0. - Vol. 50.2016, 4, p. 1286-1299
|
Subject: | two-level uncapacitated facility location | Lagrangian relaxation | Lagrangian heuristic | branch-and-bound algorithm | Mathematische Optimierung | Mathematical programming | Betriebliche Standortwahl | Firm location choice | Theorie | Theory | Tourenplanung | Vehicle routing problem | Heuristik | Heuristics | Algorithmus | Algorithm | Branch-and-Bound | Branch and Bound |
-
The parallel stack loading problem of minimizing the exact number of relocations
Tanaka, Shunji, (2024)
-
Rostami, Mohammad, (2020)
-
A semi-Lagrangian relaxation heuristic algorithm for the simple plant location problem with order
Cabezas, Xavier, (2023)
- More ...
-
Gendron, Bernard, (2017)
-
Formulations and relaxations for a multi-echelon capacitated location-distribution problem
Gendron, Bernard, (2009)
-
A multi-compartment vehicle routing problem arising in the collection of olive oil in Tunisia
Lahyani, Rahma, (2015)
- More ...