Capacitated facility location problem with general setup cost
From MaRDI portal
Publication:2496021
DOI10.1016/j.cor.2004.09.012zbMath1126.90042OpenAlexW2077713618MaRDI QIDQ2496021
Ling-Yun Wu, Xiang-Sun Zhang, Ju-liang Zhang
Publication date: 30 June 2006
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2004.09.012
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80)
Related Items
Mathematical programming methods for microgrid design and operations: a survey on deterministic and stochastic approaches ⋮ A Lagrangian heuristic for concave cost facility location problems: the plant location and technology acquisition problem ⋮ A Lagrangian heuristic for the multicommodity capacitated location problem with balancing requirements ⋮ Solving a dynamic facility location problem with partial closing and reopening ⋮ Discretized formulations for capacitated location problems with modular distribution costs ⋮ On a facility location problem with applications to tele-diagnostic ⋮ A multi-objective facility location problem in the presence of variable gradual coverage performance and cooperative cover ⋮ The location routing problem with facility sizing decisions ⋮ A capacitated biobjective location problem with uniformly distributed demands in the UAV‐supported delivery operation ⋮ Lagrangian Heuristics for Large-Scale Dynamic Facility Location with Generalized Modular Capacities ⋮ Lower and upper bounds for a two-level hierarchical location problem in computer networks ⋮ A hybrid firefly-genetic algorithm for the capacitated facility location problem ⋮ A Newton Algorithm for Semidiscrete Optimal Transport with Storage Fees ⋮ Sustainable SC through the complete reprocessing of end-of-life products by manufacturers: a traditional versus social responsibility company perspective ⋮ A computational study of a nonlinear minsum facility location problem ⋮ Two-echelon, multi-commodity supply chain network design with mode selection, lead-times and inventory costs ⋮ The double-assignment plant location problem with co-location ⋮ A facility location and installation of resources model for level of repair analysis ⋮ A branch and bound algorithm for the partial coverage capacitated plant location problem ⋮ Evacuation planning using multiobjective evolutionary optimization approach ⋮ A multi-objective parallel variable neighborhood search for the bi-objective obnoxious p-median problem ⋮ A new hybrid heuristic for replica placement and request distribution in content distribution networks
Cites Work
- Unnamed Item
- Unnamed Item
- A heuristic lagrangean algorithm for the capacitated plant location problem
- Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
- A comparison of heuristics and relaxations for the capacitated plant location problem
- A Lagrangean dual ascent algorithm for simple plant location problems
- A method for solving to optimality uncapacitated location problems
- Heuristics for the capacitated plant location model
- An algorithm for solving large capacitated warehouse location problems
- On the exact solution of large-scale simple plant location problems
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- The capacitated plant location problem
- Lagrangean heuristics for location problems
- The simple plant location problem: Survey and synthesis
- Facility location with increasing production costs
- The capacitated plant location problem with multiple facilities in the same site
- A Cross Decomposition Algorithm for Capacitated Facility Location
- Lagrangean decomposition: A model yielding stronger lagrangean bounds
- A Dual-Based Procedure for Uncapacitated Facility Location
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Optimal Facility Location with Concave Costs
- A Lagrangean heuristic for the plant location problem with multiple facilities in the same site
- An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
