𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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

✍ Scribed by Larry W. Jacobs; Michael J. Brusco

Publisher
John Wiley and Sons
Year
1995
Tongue
English
Weight
751 KB
Volume
42
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.

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

Analysis of a Local Search Heuristic for
Analysis of a Local Search Heuristic for Facility Location Problems
✍ Madhukar R. Korupolu; C.Greg Plaxton; Rajmohan Rajaraman πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 258 KB

In this paper, we study approximation algorithms for several NP-hard facility location problems.We prove that a simple local search heuristic yields polynomialtime constant-factor approximation bounds for the metric versions of the uncapacitated k-median problem and the uncapacitated facility locati