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

An efficient algorithm for the location-allocation problem with rectangular regions

โœ Scribed by Ann S. Marucheck; Adel A. Aly

Publisher
John Wiley and Sons
Year
1981
Tongue
English
Weight
759 KB
Volume
28
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Efficient Algorithm for the Complex R
An Efficient Algorithm for the Complex Roots Problem
โœ C.Andrew Neff; John H. Reif ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 406 KB

Given a univariate polynomial f (z) of degree n with complex coefficients, whose norms are less than 2 m in magnitude, the root problem is to find all the roots of f (z) up to specified precision 2 ฯชศ . Assuming the arithmetic model for computation, we provide an algorithm which has complexity O(n l

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