Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort

DOI10.1016/J.EJOR.2005.11.028MaRDI QIDQ856273zbMATH OpenOpenAlexFDO

Authors R. 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

zbMATH Keywords

distributionlocationtransportation

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)

Recommendations

• Evaluating strong, weak and hybrid formulations of the single stage capacitated warehouse location problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• An algorithm for solving large capacitated warehouse location problems
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• A partial dual algorithm for the capacitated warehouse location problem

Cites work

• scientific article; zbMATH DE number 3501240 (Why is no real title available?)
• A Cross Decomposition Algorithm for Capacitated Facility Location
• A Dual-Based Procedure for Uncapacitated Facility Location
• A comparison of heuristics and relaxations for the capacitated plant location problem
• A cost operator approach to multistage location-allocation
• A heuristic Lagrangean algorithm for the capacitated plant location problem - A comment
• A new dual based procedure for the transportation problem
• ADD-heuristics' starting procedures for capacitated plant location models
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• An efficient heuristic procedure for the capacitated warehouse location problem
• Exceptional Paper—Location of Bank Accounts to Optimize Float: An Analytic Study of Exact and Approximate Algorithms
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Heuristics for the capacitated plant location model
• Modelling a fertiliser distribution system
• Multicommodity Distribution System Design by Benders Decomposition
• Technical Note—Location Theory: A Selective Bibliography
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(1)

• Evaluating strong, weak and hybrid formulations of the single stage capacitated warehouse location problem

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q856273)