A search tree algorithm for plant location problems
type: Item
instance of: scholarly article
title: A search tree algorithm for plant location problems
zbMATH Open document ID: 0454.90029
DOI: 10.1016/0377-2217(81)90095-3
author: E. Bartezzaghi
author: Alberto Colorni
author: P. C. Palermo
published in: European Journal of Operational Research
publication date: 1981-01-01T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 65K05
zbMATH DE Number: 3711728
zbMATH Keywords: search tree algorithm
zbMATH Keywords: plant location
zbMATH Keywords: ranking procedure
zbMATH Keywords: stopping rule
zbMATH Keywords: lower bound
zbMATH Keywords: computational results
zbMATH Keywords: logistics
MaRDI profile type: Publication
full work available at URL: 0377-2217(81)90095-3
OpenAlex ID: W2010957654
cites work: An Efficient Branch and Bound Algorithm for the Capacitated Warehouse Location Problem
cites work: Optimal Location of Plants
cites work: Q4120279
cites work: Technical Note—Location Theory: A Selective Bibliography
cites work: Technical Note—Exact Solution of the Fixed-Charge Transportation Problem
cites work: A New Branch-and-Bound Algorithm for the Fixed-Charge Transportation Problem
cites work: An Efficient Branch and Bound Algorithm for the Warehouse Location Problem
cites work: Solving the Fixed Charge Problem by Ranking the Extreme Points
cites work: An Analysis of Private and Public Sector Location Models
cites work: Algorithms for the Simple Plant-Location Problem with Some Side Conditions
cites work: A Heuristic Adjacent Extreme Point Algorithm for the Fixed Charge Problem
description: scientific article; zbMATH DE number 3711728