𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An efficient heuristic for large set covering problems

✍ Scribed by Francis J. Vasko

Publisher
John Wiley and Sons
Year
1984
Tongue
English
Weight
477 KB
Volume
31
Category
Article
ISSN
0894-069X

No coin nor oath required. For personal study only.

✦ Synopsis

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.

πŸ“œ SIMILAR VOLUMES

An efficient heuristic for the multi-ite
An efficient heuristic for the multi-item newsboy problem with a single constraint
✍ Steven Nahmias; Charles P. Schmidt πŸ“‚ Article πŸ“… 1984 πŸ› John Wiley and Sons 🌐 English βš– 493 KB

This article treats the problem of determining optimal and approximately optimal order quantities for a multiple-item inventory system subject to a single constraint on space or budget. Although this problem can be solved by the usual method of Lagrange multipliers, we wish to consider a more effici

Large-scale local search heuristics for
Large-scale local search heuristics for the capacitated vertex p-center problem
✍ Maria Paola Scaparra; Stefano Pallottino; Maria Grazia ScutellΓ  πŸ“‚ Article πŸ“… 2004 πŸ› John Wiley and Sons 🌐 English βš– 296 KB

## Abstract This article investigates the application of very large neighborhood search techniques for solving the capacitated vertex __p__‐center problem. We characterize a local search neighborhood in terms of path and cyclic exchanges of customers among facilities, and exploit principles borrowe