A partial dual algorithm for the capacitated warehouse location problem

DOI10.1016/0377-2217(86)90213-4zbMath0581.90024OpenAlexW2020272219MaRDI QIDQ1067966

Barrie M. 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

transportationfacility locationtree searchComputational resultsCapacitated Warehouse Location Problempartial dual algorithm

Mathematics Subject Classification ID

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

Related Items

An algorithm for solving large capacitated warehouse location problems, Approximate solutions to large scale capacitated facility location problems, An improved particle swarm optimization for the automobile spare part warehouse location problem, Lagrangean heuristics for location problems, Computational results from a new Lagrangean relaxation algorithm for the capacitated plant location problem, An optimal algorithm for the multiproduct capacitated facility location problem with a choice of facility type

Cites Work

• Unnamed Item
• Extensions to a Lagrangean relaxation approach for the capacitated warehouse location problem
• A Computation Study on Start Procedures, Basis Change Criteria, and Solution Algorithms for Transportation Problems
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Improved Algorithm for the Capacitated Facility Location Problem
• Validation of subgradient optimization
• A branch‐bound algorithm for the capacitated facilities location problem