A search tree algorithm for plant location problems

DOI10.1016/0377-2217(81)90095-3zbMath0454.90029OpenAlexW2010957654MaRDI QIDQ1149880

E. Bartezzaghi, P. C. Palermo, Alberto Colorni

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)90095-3

zbMATH Keywords

lower boundstopping rulecomputational resultslogisticsplant locationranking proceduresearch tree algorithm

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Inventory, storage, reservoirs (90B05)

Related Items (4)

An algorithm for solving large capacitated warehouse location problems ⋮ A neural model for the \(p\)-median problem ⋮ Lagrangean dual ascent algorithms for computing bounds in capacitated plant location problems ⋮ A search tree algorithm for plant location problems

Cites Work

• Unnamed Item
• A search tree algorithm for plant location problems
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• Optimal Location of Plants
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• Technical Note—Location Theory: A Selective Bibliography
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• An Analysis of Private and Public Sector Location Models
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Solving the Fixed Charge Problem by Ranking the Extreme Points

This page was built for publication: A search tree algorithm for plant location problems