๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

New simple and efficient heuristics for the uncapacitated single allocation hub location problem

โœ Scribed by Marcos Roberto Silva; Claudio B. Cunha

Book ID
108105907
Publisher
Elsevier Science
Year
2009
Tongue
English
Weight
555 KB
Volume
36
Category
Article
ISSN
0305-0548

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A hybrid heuristic for the uncapacitated
A hybrid heuristic for the uncapacitated hub location problem
โœ Sue Abdinnour-Helm ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 991 KB

Given n interacting nodes in a network, the Uncapacitated Hub Location Problem (UHP) determines the number of hubs, the location for the hubs, and the assignment of the spokes to hubs that minimizes the overall transportation cost. The hubs are interconnected and each spoke is assigned to a single h

An efficient heuristic procedure for the
An efficient heuristic procedure for the uncapacitated warehouse location problem
โœ Basheer M. Khumawala ๐Ÿ“‚ Article ๐Ÿ“… 1973 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 681 KB

## Abstract This paper introduces an efficient heuristic procedure for a special class of mixed integer programming problems called the uncapacitated warehouse (plant) location problem. This procedure is derived from the branching decision rules proposed for the branch and bound algorithm by the au