✦ LIBER ✦

Hybrid heuristics for minimum cardinality set covering problems

✍ Scribed by Francis J. Vasko; George R. Wilson

Publisher: John Wiley and Sons
Year: 1986
Tongue: English
Weight: 407 KB
Volume: 33
Category: Article
ISSN: 0894-069X
DOI: 10.1002/nav.3800330207

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lagrangian heuristic for set-covering

A lagrangian heuristic for set-covering problems

✍ J. E. Beasley 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 662 KB

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.

Note: A local-search heuristic for large

Note: A local-search heuristic for large set-covering problems

✍ Larry W. Jacobs; Michael J. Brusco 📂 Article 📅 1995 🏛 John Wiley and Sons 🌐 English ⚖ 751 KB

Models and heuristics for a minimum arbo

Models and heuristics for a minimum arborescence problem

✍ Christophe Duhamel; Luis Gouveia; Pedro Moura; Mauricio Souza 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 194 KB

## Abstract The Minimum Arborescence problem (MAP) consists of finding a minimum cost arborescence in a directed graph. This problem is NP‐Hard and is a generalization of two well‐known problems: the Minimum Spanning Arborescence Problem (MSAP) and the Directed Node Weighted Steiner Tree Problem (D

Heuristic solutions for general concave

Heuristic solutions for general concave minimum cost network flow problems

✍ Dalila B.M.M. Fontes; José Fernando Gonçalves 📂 Article 📅 2007 🏛 John Wiley and Sons 🌐 English ⚖ 214 KB

## Abstract We address the single‐source uncapacitated minimum cost network flow problem with general concave cost functions. Exact methods to solve this class of problems in their full generality are only able to address small to medium size instances, since this class of problems is known to be N

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