A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
From MaRDI portal
Publication:4405938
DOI10.1080/1055678021000039184zbMath1032.90016OpenAlexW2061931400WikidataQ58921724 ScholiaQ58921724MaRDI QIDQ4405938
Gianpaolo Ghiani, Lucio Grandinetti, Francesca Guerriero, Roberto Musmanno
Publication date: 2002
Published in: Optimization Methods and Software (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/1055678021000039184
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Discrete location and assignment (90B80)
Related Items (4)
Integer linear programming models for grid-based light post location problem ⋮ Optimization models for the dynamic facility location and allocation problem ⋮ Solving the facility location and fixed charge solid transportation problem ⋮ Capacitated facility location problem with general setup cost
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Approximate solutions to large scale capacitated facility location problems
- Heuristics for the capacitated plant location model
- ADD-heuristics' starting procedures for capacitated plant location models
- An algorithm for solving large capacitated warehouse location problems
- Lot-size models with backlogging: Strong reformulations and cutting planes
- Facility location models for planning a transatlantic communications network
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- Approximation algorithms for geometric median problems
- Valid inequalities and facets of the capacitated plant location problem
- An efficient tabu search procedure for the \(p\)-median problem
- A Lagrangean heuristic for the facility location problem with staircase costs
- The capacitated plant location problem
- The capacitated plant location problem with multiple facilities in the same site
- Dominance Criteria for the Capacitated Warehouse Location Problem
- Lagrangian relaxation for the star-star concentrator location problem: Approximation algorithm and bounds
- Location Problems Arising in Computer Networks
- Accelerating Benders Decomposition: Algorithmic Enhancement and Model Selection Criteria
- An efficient heuristic procedure for the capacitated warehouse location problem
- Capacitated Facility Location: Valid Inequalities and Facets
- Capacitated clustering problems by hybrid simulated annealing and tabu search
This page was built for publication: A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
