Bounds for the single source modular capacitated plant location problem
From MaRDI portal
Publication:2489136
DOI10.1016/j.cor.2005.02.030zbMath1086.90035OpenAlexW1978115795MaRDI QIDQ2489136
Isabel H. Correia, Maria Eugénia Captivo
Publication date: 16 May 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2005.02.030
Continuous location (90B85) Approximation methods and heuristics in mathematical programming (90C59)
Related Items (6)
Solution method for the location planning problem of logistics park with variable capacity ⋮ The continuous single source location problem with capacity and zone-dependent fixed cost: models and solution approaches ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Location of slaughterhouses under economies of scale ⋮ Stochastic facility location with general long-run costs and convex short-run costs ⋮ Using Logic-Based Benders Decomposition to Solve the Capacity- and Distance-Constrained Plant Location Problem
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Avoiding local optima in the \(p\)-hub location problem using tabu search and GRASP
- An algorithm for solving large capacitated warehouse location problems
- An efficient tabu search procedure for the \(p\)-median problem
- A Lagrangean heuristic for the facility location problem with staircase costs
- Solving the staircase cost facility location problem with decomposition and piecewise linearization
- Upper and lower bounds for the single source capacitated location problem.
- A Lagrangean heuristic for a modular capacitated location problem
- A two-phase tabu search approach to the location routing problem
- Lagrangean heuristics for location problems
- Validation of subgradient optimization
This page was built for publication: Bounds for the single source modular capacitated plant location problem
