lagrangian relaxations
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 1)

H-INDEX

3
(FIVE YEARS 0)

Author(s):  
Mohammad Rahim Akhavan Kazemzadeh ◽  
Tolga Bektaş ◽  
Teodor Gabriel Crainic ◽  
Antonio Frangioni ◽  
Bernard Gendron ◽  
...  

2018 ◽  
Vol 71 (3) ◽  
pp. 551-569 ◽  
Author(s):  
Immanuel M. Bomze ◽  
Vaithilingam Jeyakumar ◽  
Guoyin Li

2017 ◽  
Vol 31 (5) ◽  
pp. 1331-1358 ◽  
Author(s):  
Eric Malmi ◽  
Sanjay Chawla ◽  
Aristides Gionis

Author(s):  
Igor Litvinchev ◽  
Miguel Mata ◽  
Lucero Ozuna ◽  
Jania Saucedo ◽  
Socorro Rangel

In the two-stage capacitated facility location problem, a single product is produced at some plants in order to satisfy customer demands. The product is transported from these plants to some depots and then to the customers. The capacities of the plants and depots are limited. The aim is to select cost minimizing locations from a set of potential plants and depots. This cost includes fixed cost associated with opening plants and depots, and variable cost associated with both transportation stages. In this work two different mixed integer linear programming formulations are considered for the problem. Several Lagrangian relaxations are analyzed and compared, a Lagrangian heuristic producing feasible solutions is presented. The results of a computational study are reported.


Sign in / Sign up

Export Citation Format

Share Document