A cost operator approach to multistage location-allocation

DOI10.1016/0377-2217(81)90201-0zbMath0451.90039OpenAlexW2017157465MaRDI QIDQ1148206

Gerald L. Thompson, Robert V. Nagelhout

Publication date: 1981

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

Full work available at URL: https://doi.org/10.1016/0377-2217(81)90201-0

zbMATH Keywords

mixed integer programmingcomputational resultslocationnetwork locationcapacity constraintsnetwork structurecost operator algorithmcost operator approachmultistage factory-warehouse locationallocation problemsubmodularity of the objective function

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Applications of mathematical programming (90C90) Mixed integer programming (90C11) Inventory, storage, reservoirs (90B05)

Related Items (6)

Developing new formulations and relaxations of single stage capacitated warehouse location problem (SSCWLP): empirical investigation for assessing relative strengths and computational effort ⋮ A branch-and-bound algorithm for the transportation problem with location of \(p\) transshipment points ⋮ Complements and substitutes among locations in the two-stage transshipment problem ⋮ The capacitated plant location problem ⋮ A branch and bound algorithm for the two-level uncapacitated facility location problem with some side constraints ⋮ A tree search algorithm for the multi-commodity location problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• An operator theory of parametric programming for the transportation problem-I
• A Dual-Based Procedure for Uncapacitated Facility Location
• Comments on the note of Frieze
• 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
• Technical Note—An Algorithm for the p-Median Problem
• An analysis of approximations for maximizing submodular set functions—I
• An Improved Algorithm for the Capacitated Facility Location Problem
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• A branch‐bound algorithm for the capacitated facilities location problem

This page was built for publication: A cost operator approach to multistage location-allocation