𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Local search, reducibility and approximability of NP-optimization problems

✍ Scribed by Giorgio Ausiello; Marco Protasi

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
699 KB
Volume
54
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Local and global searches of approximate
Local and global searches of approximate optimal designs of regular frames
✍ M. Ohsaki πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 163 KB

Methods of local and global searches of approximate optimal designs minimizing total structural volume under stress and displacement constraints are presented for regular frames subjected to static loads. Nonuniqueness of the optimal solution is extensively utilized for local search of approximate o

The discrete search problem and the cons
The discrete search problem and the construction of optimal allocations
✍ Ingo Wegener πŸ“‚ Article πŸ“… 1982 πŸ› John Wiley and Sons 🌐 English βš– 646 KB

## Abstract Suppose one object is hidden in the __k__‐th of __n__ boxes with probability __p__(__k__). The boxes are to be searched sequentially. Associated with the __j__‐th search of box __k__ is a cost __c__(__j,k__) and a conditional probability __q__(__j,k__) that the first __j__ ‐ 1 searches