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

New local search approximation techniques for maximum generalized satisfiability problems

โœ Scribed by Paola Alimonti


Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
674 KB
Volume
57
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Local search techniques for the generali
โœ Scott E. Sampson; Elliott N. Weiss ๐Ÿ“‚ Article ๐Ÿ“… 1993 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 665 KB

In this article we address the problem of scheduling a single project network with both precedence and resource constraints through the use of a local search technique. We choose a solution definition which guarantees precedence feasibility, allowing the procedure to focus on overcoming resource inf