An effective hybrid approach to the two-stage capacitated facility location problem
From MaRDI portal
Publication:1713740
DOI10.1016/j.ejor.2018.11.062zbMath1430.90387OpenAlexW2902552820WikidataQ128851699 ScholiaQ128851699MaRDI QIDQ1713740
Haoxun Chen, Feng Chu, Zhen Yang, Nengmin Wang
Publication date: 28 January 2019
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.11.062
Integer programming (90C10) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items
Two-phase semi-Lagrangian relaxation for solving the uncapacitated distribution centers location problem for B2C E-commerce ⋮ Multi-objective solid transportation-location problem with variable carbon emission in inventory management: a hybrid approach ⋮ Electric aircraft charging network design for regional routes: a novel mathematical formulation and kernel search heuristic
Uses Software
Cites Work
- Unnamed Item
- A heuristic for BILP problems: the single source capacitated facility location problem
- Facility location models for distribution system design
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Kernel search: a general heuristic for the multi-dimensional knapsack problem
- An exact algorithm for large multiple knapsack problems
- Reformulation of capacitated facility location problems: How redundant information can help
- Upper and lower bounds for the two-level simple plant location problem
- Applying Lagrangian relaxation to the resolution of two-stage location problems
- Capacitated facility location: Separation algorithms and computational experience
- Lagrangian heuristics for the two-echelon, single-source, capacitated facility location problem
- A multi-commodity, multi-plant, capacitated facility location problem: Formulation and efficient heuristic solution.
- Local branching
- A Lagrangian relax-and-cut approach for the two-stage capacitated facility location problem
- An improved cut-and-solve algorithm for the single-source capacitated facility location problem
- Multi-level facility location problems
- A cut-and-solve based algorithm for the single-source capacitated facility location problem
- Sequence independent lifting in mixed integer programming
- Faster MIP solutions via new node selection rules
- Cut-and-solve: An iterative search strategy for combinatorial optimization problems
- A cut and branch approach for the capacitated \(p\)-median problem based on Fenchel cutting planes
- Lower and upper bounds for a two-stage capacitated facility location problem with handling costs
- Separation algorithms for 0-1 knapsack polytopes
- New facets for the two-stage uncapacitated facility location polytope
- An LP-based heuristic for two-stage capacitated facility location problems
- Multicommodity Distribution System Design by Benders Decomposition
- Production, Transportation, and Distribution Planning in a Multi-Commodity Tri-Echelon System
- Lifted Cover Inequalities for 0-1 Integer Programs: Complexity
- Solving capacitated facility location problems by Fenchel cutting planes
- Solving Multiple Knapsack Problems by Cutting Planes
- On the Two-Level Uncapacitated Facility Location Problem
This page was built for publication: An effective hybrid approach to the two-stage capacitated facility location problem
