A tree search algorithm for the multi-commodity location problem (Q1058962)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A tree search algorithm for the multi-commodity location problem |
scientific article; zbMATH DE number 3902361
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A tree search algorithm for the multi-commodity location problem |
scientific article; zbMATH DE number 3902361 |
Statements
A tree search algorithm for the multi-commodity location problem (English)
0 references
1985
0 references
The multi-commodity location problem is an extension of the simple plant location problem. The problem is to decide on locations of facilities to meet customer demands for several commodities in such a way that total fixed plus variable costs are minimized. Only one commodity may be supplied from any location. In this paper a primal and a dual heuristic for producing good bounds are presented. A method of improving these bounds by using a new Lagrangean relaxation for the problem is also presented. Computational results with problems taken from the literature are provided.
0 references
tree search algorithm
0 references
multi-commodity location problem
0 references
dual heuristic
0 references
bounds
0 references
Lagrangean relaxation
0 references
