𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A lagrangian heuristic for set-covering problems

✍ Scribed by J. E. Beasley

Publisher
John Wiley and Sons
Year
1990
Tongue
English
Weight
662 KB
Volume
37
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An efficient heuristic for large set cov
An efficient heuristic for large set covering problems
✍ Francis J. Vasko πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 477 KB

## Abstract A heuristic solution procedure for set covering is presented that works well for large, relatively dense problems. In addition, a confidence interval is established about the unknown global optimum. Results are presented for 30 large randomly generated problems.

The proportion heuristic: problem set si
The proportion heuristic: problem set size as a basis for performance judgments
✍ David H. Silvera; Robert A. Josephs; R. Brian Giesler πŸ“‚ Article πŸ“… 2001 πŸ› John Wiley and Sons 🌐 English βš– 119 KB

## Abstract How do people evaluate their degree of mastery over a task? A series of four studies demonstrated that a potentially irrelevant cue can have a strong influence on such evaluations. In these studies, the total amount of work given to participants (the problem set size) influenced both (a

A generalization of the weighted set cov
A generalization of the weighted set covering problem
✍ Jian Yang; Joseph Y-T. Leung πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 122 KB

## Abstract We study a generalization of the weighted set covering problem where every element needs to be covered multiple times. When no set contains more than two elements, we can solve the problem in polynomial time by solving a corresponding weighted perfect __b__‐matching problem. In general,