Article1977

An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem

243 citations0/0 files storedManagement Science

No readable copy stored yet — this record is metadata only.

Facility Location and Emergency Management Vehicle Routing Optimization Methods Optimization and Mathematical Programming

Abstract

This paper describes an efficient solution procedure for the warehouse location problem in which limitations on the amount of goods which can be handled are also imposed. The proposed branch-and-bound solution method is made efficient by developing dominance, lower and upper bounding procedures and branch and node selection rules utilizing the special structure of this problem. Computational results are provided for large sized problems.

Citations in this library

Stored only when both papers are in the corpus — 243 citations exist upstream.

References

1976A Heuristic Program for Locating Warehouses 1972An Efficient Branch and Bound Algorithm for the Warehouse Location Problem

Cited by

1978Multiple Resource–Constrained Scheduling Using Branch and Bound 1995The capacitated plant location problem 2008Capacitated warehouse location model with risk pooling 1987Efficient algorithms for the capacitated concentrator location problem 1986A Lagrangian Relaxation Heuristic for Capacitated Facility Location with Single-Source Constraints 2001An algorithm for the capacitated, multi-commodity multi-period facility location problem 2004Capacitated facility location problem with general setup cost 1983Locational analysis

Imported from OpenAlex (CC0) — nothing here is generated.