A partial dual algorithm for the capacitated warehouse location problem

DOI10.1016/0377-2217(86)90213-4MaRDI QIDQ1067966zbMATH OpenOpenAlexFDO

Authors Barrie Baker

Publication date 1986

Published in European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0377-2217(86)90213-4

zbMATH Keywords

facility locationtransportationtree searchComputational resultsCapacitated Warehouse Location Problempartial dual algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Inventory, storage, reservoirs (90B05) Special problems of linear programming (transportation, multi-index, data envelopment analysis, etc.) (90C08)

Recommendations

• An algorithm for solving large capacitated warehouse location problems
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• A branch and bound algorithm for the partial coverage capacitated plant location problem
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• A large-scale application of the partial coverage uncapacitated facility location problem

Cites work

• scientific article; zbMATH DE number 3614502 (Why is no real title available?)
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• A branch‐bound algorithm for the capacitated facilities location problem
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• Validation of subgradient optimization

Cited in

(13)

• Lagrangean heuristics for location problems
• An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type
• Dominance Criteria for the Capacitated Warehouse Location Problem
• Approximate solutions to large scale capacitated facility location problems
• Optimizing the location-allocation problem of pharmacy warehouses: A case study in Gaziantep
• Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem
• Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort
• An algorithm for solving large capacitated warehouse location problems
• A branch and bound algorithm for the partial coverage capacitated plant location problem
• Lagrangean‐based solution approaches for the generalized problem of locating capacitated warehouses
• Evaluating strong, weak and hybrid formulations of the single stage capacitated warehouse location problem
• An improved particle swarm optimization for the automobile spare part warehouse location problem
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem

This page was built for publication: A partial dual algorithm for the capacitated warehouse location problem

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