A probabilistic heuristic for a computationally difficult set covering problem

Authors:
Thomas A Feo;Mauricio G. C Resende
Affiliations:
The University of Texas, Austin, TX 78712, USA;University of California, Berkeley, CA 94720, USA
Venue:
Operations Research Letters
Year:
1989

Citing 2
Cited 51

Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Semi-greedy heuristics: An empirical study

Operations Research Letters

Analysis of new variable selection methods for discriminant analysis

Computational Statistics & Data Analysis
Metaheuristics for optimization problems in computer communications

Computer Communications
Reactive GRASP for the strip-packing problem

Computers and Operations Research
A greedy randomized adaptive search procedure for the point-feature cartographic label placement

Computers & Geosciences
Logic classification and feature selection for biomedical data

Computers & Mathematics with Applications
Mining typical patterns from databases

Information Sciences: an International Journal
Heuristics for the bi-objective path dissimilarity problem

Computers and Operations Research
A mathematical program to refine gene regulatory networks

Discrete Applied Mathematics
Multi-objective genetic local search algorithm using Kohonen's neural map

Computers and Industrial Engineering
GRASP and path relinking for the max-min diversity problem

Computers and Operations Research
The SR-GCWS hybrid algorithm for solving the capacitated vehicle routing problem

Applied Soft Computing
Using a greedy random adaptative search procedure to solve the cover printing problem

Computers and Operations Research
Efficient RNAi-based gene family knockdown via set cover optimization

Artificial Intelligence in Medicine
Solving two location models with few facilities by using a hybrid heuristic: a real health resources case

Computers and Operations Research - Articles presented at the conference on routing and location (CORAL)
Logic based methods for SNPs tagging and reconstruction

Computers and Operations Research
Investigation of a new GRASP-based clustering algorithm applied to biological data

Computers and Operations Research
A Path Relinking approach for the Team Orienteering Problem

Computers and Operations Research
Deriving operating policies for multi-objective reservoir systems: Application of Self-Learning Genetic Algorithm

Applied Soft Computing
A GRASP-based network re-optimization strategy for improving RWA in multi-constrained optical transport infrastructures

Computer Communications
A guided reactive GRASP for the capacitated multi-source Weber problem

Computers and Operations Research
A GRASP algorithm for fast hybrid (filter-wrapper) feature subset selection in high-dimensional datasets

Pattern Recognition Letters
The City Trip Planner: An expert system for tourists

Expert Systems with Applications: An International Journal
A GRASP algorithm for the Closest String Problem using a probability-based heuristic

Computers and Operations Research
A GRASP method for building classification trees

Expert Systems with Applications: An International Journal
Real-time multiserver and multichannel systems with shortage of maintenance crews

Mathematical and Computer Modelling: An International Journal
Solving large Steiner Triple Covering Problems

Operations Research Letters
Solving hard set covering problems

Operations Research Letters
Efficient feature selection filters for high-dimensional data

Pattern Recognition Letters
Branch and bound for the cutwidth minimization problem

Computers and Operations Research
Swarm optimisation algorithms applied to large balanced communication networks

Journal of Network and Computer Applications
An efficient compact quadratic convex reformulation for general integer quadratic programs

Computational Optimization and Applications
Combining Monte Carlo simulation with heuristics for solving the inventory routing problem with stochastic demands

Proceedings of the Winter Simulation Conference
A hybrid discrete artificial bee colony algorithm for permutation flowshop scheduling problem

Applied Soft Computing
Bi-objective optimization of the intermodal terminal location problem as a policy-support tool

Computers in Industry
A hybrid GRASP heuristic to construct effective drawings of proportional symbol maps

Computers and Operations Research
Designing routes for WEEE collection: the vehicle routing problem with split loads and date windows

Journal of Heuristics
GRASP algorithms for the robust railway network design problem

Journal of Heuristics
A survey on optimization metaheuristics

Information Sciences: an International Journal
QoS-driven optimisation of composite web services: an approach based on GRASP and analytical models

International Journal of Web and Grid Services
A GRASP/Path Relinking algorithm for two- and three-dimensional multiple bin-size bin packing problems

Computers and Operations Research
A GRASP metaheuristic for microarray data analysis

Computers and Operations Research
A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering

Computers and Operations Research
A hybrid data mining GRASP with path-relinking

Computers and Operations Research
A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem

Computers and Operations Research
A hybrid column generation with GRASP and path relinking for the network load balancing problem

Computers and Operations Research
ParadisEO-MO: from fitness landscape analysis to efficient local search algorithms

Journal of Heuristics
Randomized heuristics for handover minimization in mobility networks

Journal of Heuristics
A discrete gravitational search algorithm for solving combinatorial optimization problems

Information Sciences: an International Journal
GRASP for the uncapacitated r-allocation p-hub median problem

Computers and Operations Research
Adaptive and multi-mining versions of the DM-GRASP hybrid metaheuristic

Journal of Heuristics
A GRASP + ILP-based metaheuristic for the capacitated location-routing problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

An efficient probabilistic set covering heuristic is presented. The heuristic is evaluated on empirically difficult to solve set covering problems that arise from Steiner triple systems. The optimal solution to only a few of these instances is known. The heuristic provides these solutions as well as the best known solutions to all other instances attempted.