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

A heuristic algorithm for a network problem with variable upper bounds

โœ Scribed by Bala Shetty

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
929 KB
Volume
20
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

A heuristic network procedure for the as
A heuristic network procedure for the assembly line balancing problem
โœ Peter A. Pinto; David G. Dannenbring; Basheer M. Khumawala ๐Ÿ“‚ Article ๐Ÿ“… 1978 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 417 KB

## Abstract Proposed is a Heuristic Network (HN) Procedure for balancing assembly lines. The procedure uses simple heuristic rules to generate a network which is then traversed using a shortest route algorithm to obtain a heuristic solution. The advantages of the HN Procedure are: a) it generally y

The critical-item, upper bounds, and a b
The critical-item, upper bounds, and a branch-and-bound algorithm for the tree knapsack problem
โœ Shaw, Dong X.; Cho, Geon ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 155 KB ๐Ÿ‘ 2 views

The tree knapsack problem (TKP) is a generalized 0-1 knapsack problem where all the items (nodes) are subjected to a partial ordering represented by a rooted tree. If a node is selected to be packed into the knapsack, then all the items on the path from the selected node to the root must also be pac