## 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
An efficient heuristic procedure for the uncapacitated warehouse location problem
โ Scribed by Basheer M. Khumawala
- Publisher
- John Wiley and Sons
- Year
- 1973
- Tongue
- English
- Weight
- 681 KB
- Volume
- 20
- Category
- Article
- ISSN
- 0894-069X
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici
In 1995 the two senior authors of the present paper introduced a new algorithm designed to replace the Taylor-Galerkin (or Lax-Wendroff) methods, used by them so far in the solution of compressible flow problems. The new algorithm was applicable to a wide variety of situations, including fully incom