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

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.

โœฆ Synopsis

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 author in an earlier paper. It can be viewed as tracing a single path of the branch and bound tree (from the initial node to the terminal node), the path being determined by the particular branching decision rule used. Unlike branch and bound the computational efficiency of this procedure is substantially less than linearly related to the number of potential warehouse locations (integer variables) in the problem. Its computational efficiency is tested on problems found in the literature.

๐Ÿ“œ SIMILAR VOLUMES

An efficient heuristic for the multi-ite
An efficient heuristic for the multi-item newsboy problem with a single constraint
โœ Steven Nahmias; Charles P. Schmidt ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 493 KB

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

The characteristic-based-split procedure
The characteristic-based-split procedure: an efficient and accurate algorithm for fluid problems
โœ O.C. Zienkiewicz; P. Nithiarasu; R. Codina; M. Vรกzquez; P. Ortiz ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 993 KB

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