Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
From MaRDI portal
Publication:856273
DOI10.1016/j.ejor.2005.11.028zbMath1109.90057OpenAlexW1988149616MaRDI QIDQ856273
R. R. K. Sharma, Vincent Berry
Publication date: 7 December 2006
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2005.11.028
Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Cites Work
- Unnamed Item
- A comparison of heuristics and relaxations for the capacitated plant location problem
- Modelling a fertiliser distribution system
- Heuristics for the capacitated plant location model
- A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
- ADD-heuristics' starting procedures for capacitated plant location models
- A cost operator approach to multistage location-allocation
- Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
- A new dual based procedure for the transportation problem
- A Cross Decomposition Algorithm for Capacitated Facility Location
- A Dual-Based Procedure for Uncapacitated Facility Location
- Worst-Case Analysis of Heuristic Algorithms
- An efficient heuristic procedure for the capacitated warehouse location problem
- Multicommodity Distribution System Design by Benders Decomposition
- An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
- Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
- An Improved Algorithm for the Capacitated Facility Location Problem
- Technical Note—Location Theory: A Selective Bibliography
This page was built for publication: Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
