A search tree algorithm for plant location problems

DOI10.1016/0377-2217(81)90095-3MaRDI QIDQ1149880zbMATH OpenOpenAlexFDO

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

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

stopping rulelogisticslower boundcomputational resultsplant locationranking proceduresearch tree algorithm

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 3545328 (Why is no real title available?)
• A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
• A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
• A search tree algorithm for plant location problems
• Algorithms for the Simple Plant-Location Problem with Some Side Conditions
• An Analysis of Private and Public Sector Location Models
• An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
• An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
• Optimal Location of Plants
• Solving the Fixed Charge Problem by Ranking the Extreme Points
• Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
• Technical Note—Location Theory: A Selective Bibliography

Cited in

(4)

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

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

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