𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A heuristic solution procedure for the multiconstraint zero-one knapsack problem

✍ Scribed by Hasan Pirkul

Publisher
John Wiley and Sons
Year
1987
Tongue
English
Weight
700 KB
Volume
34
Category
Article
ISSN
0894-069X

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

A PROCEDURE FOR THE OPTIMAL SYNTHESIS OF
A PROCEDURE FOR THE OPTIMAL SYNTHESIS OF PLANAR MECHANISMS BASED ON NON-LINEAR POSITION PROBLEMS
✍ RAFAEL AVILΓ‰S; M. B. GOIZALDE AJURIA; JAVIER VALLEJO; ALFONSO HERNÁNDEZ πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 293 KB πŸ‘ 3 views

The present paper describes a procedure for the optimal dimensional synthesis of mechanisms which is based on the solution of non-linear position problems. Planar mechanisms are modelled very easily by means of finite elements of bi-hinged rod type. The judicious choice of constraint conditions make