Algorithms for the Set Covering Problem

No abstract is available for this paper.

• Publication year

  2000

• Venue

  Annals of Operations Research

• Publication date

  2000-12-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1023/A:1019225027893
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A morphing procedure to supplement a simulated annealing heuristic for cost‐ andcoverage‐correlated set‐covering problems

  1999cited by this paper
• A Heuristic Method for the Set Covering Problem

  1999cited by this paper
• A Lagrangian-based heuristic for large-scale set covering problems

  1998influential reference
• Algorithms for railway crew management

  1997cited by this paper
• Solving Large Scale Crew Scheduling Problems

  1997cited by this paper
• Simple Lagrangian heuristic for the set covering problem

  1997cited by this paper
• Mathematical programming

  1997cited by this paper
• A Genetic Algorithm for the Set Covering Problem

  1996cited by this paper
• An algorithm for large scale 0–1 integer programming with application to airline crew scheduling

  1995cited by this paper
• Note: A local-search heuristic for large set-covering problems

  1995influential reference
• On the hardness of approximating minimization problems

  1994cited by this paper
• A surrogate heuristic for set covering problems

  1994influential reference
• Enhancing an algorithm for set covering problems

  1992cited by this paper
• A Separation Routine for the Set Covering Polytope

  1992cited by this paper
• A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering

  1992influential reference
• OR-Library: Distributing Test Problems by Electronic Mail

  1990cited by this paper
• Knapsack Problems: Algorithms and Computer Implementations

  1990cited by this paper
• Performance of various computers using standard linear equations software

  1990influential reference
• A lagrangian heuristic for set‐covering problems

  1990influential reference
• An algorithm for set covering problem

  1987cited by this paper
• An Applications Oriented Guide to Lagrangian Relaxation

  1985cited by this paper
• The NP-Completeness Column: An Ongoing Guide

  1982cited by this paper
• A class of location, distribution and scheduling problems : modeling and solution methods

  1982cited by this paper
• SET COVERING PROBLEMS

  1980cited by this paper
• Johnson: computers and intractability: a guide to the theory of np- completeness (freeman

  1979cited by this paper
• The traveling-salesman problem and minimum spanning trees: Part II

  1971cited by this paper
• The Traveling-Salesman Problem and Minimum Spanning Trees

  1970cited by this paper

• Optimising image acquisition geometry by uncrewed aerial vehicles: A framework for 3D reconstruction of coastal cliffs

  2026cites this paper
• A Simple Hybrid Approach for Solving Set Covering Problems with Conflict Constraints

  2026cites this paper
• Light-EvoOPT: A Lightweight Evolutionary Optimization Framework for Ultralarge-Scale Mixed Integer Linear Programs

  2026cites this paper
• RandSet: Randomized Corpus Reduction for Fuzzing Seed Scheduling

  2026influential citation
• Optimal location of refuelling stations for hydrogen-powered freight vehicles: models and methods

  2025cites this paper
• Energy-efficient route planning for optimizing underwater pipeline inspections using Resident Autonomous Underwater Vehicles

  2025cites this paper
• A Stochastic Formulation for the Dig-Limit Definition Problem in Short-Term Mine Planning Under Grade Uncertainty

  2025cites this paper
• The forget-set identification problem

  2025cites this paper
• Optimal solution to the set cover problem with a vicinity constraint for estimating genotype tissue expression profiles

  2025cites this paper
• HyP-ASO: A Hybrid Policy-based Adaptive Search Optimization Framework for Large-Scale Integer Linear Programs

  2025cites this paper
• MILPBench: A Large-scale Benchmark Test Suite for Mixed Integer Linear Programming Problems

  2025cites this paper
• Wave Function Collapse Set Covering and the Hill Climbing Algorithm: A New, Fast Heuristic and Metaheuristic Pairing for the Minimum Set Cover Problem

  2025cites this paper
• Integrated Data Collection and Model Retraining Optimization in UAV-Enabled ECNs

  2025cites this paper
• A Probabilistic Optimization Approach to the Equitable Controller Location Problem

  2025cites this paper
• OptiHive: Ensemble Selection for LLM-Based Optimization via Statistical Modeling

  2025cites this paper
• Rasengan: A Transition Hamiltonian-based Approximation Algorithm for Solving Constrained Binary Optimization Problems

  2025cites this paper
• Introducing Covering Problems for the Electronic Wafer Test

  2025cites this paper
• Efficient Graph Embedding at Scale: Optimizing CPU-GPU-SSD Integration

  2025cites this paper
• Heuristic Approaches to the Multi-Site Wafer Covering Problem

  2025cites this paper
• OptMATH: A Scalable Bidirectional Data Synthesis Framework for Optimization Modeling

  2025cites this paper
• TeamPlus: A data-driven tool utilizing a Genetic Algorithm for optimal software team formation

  2025cites this paper
• AutoOpt: A Dataset and a Unified Framework for Automating Optimization Problem Solving

  2025cites this paper
• An exact algorithm for the Minimum Gap Graph Partitioning Problem

  2025cites this paper
• Intelligent design of sensor networks for data-driven sensor maintenance at railways

  2024cites this paper
• Efficient Mathematical Programming Formulation and Algorithmic Framework for Optimal Camera Placement

  2024cites this paper
• A branch-and-cut approach to solve the Fault Diagnosis Problem with Lazy Spread and imperfect system information

  2024cites this paper
• Optimal Scheduling for Uncoded and Coded Multicast in Millimeter Wave Networks Leveraging Directionality and Reflections

  2024cites this paper
• Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis

  2024cites this paper
• A Binary Chaotic White Shark Optimizer

  2024cites this paper
• Nonparametric inference of higher order interaction patterns in networks

  2024cites this paper
• Tabu Search-Based Heuristic Solver for General Integer Linear Programming Problems

  2024cites this paper
• scpQCA: Enhancing mvQCA Applications through Set-Covering-Based QCA Method

  2024cites this paper
• Maritime accidents-based optimal rescue ship location using dynamic programming and particle swarm optimisation algorithm

  2024cites this paper
• B2MAPO: A Batch-by-Batch Multi-Agent Policy Optimization to Balance Performance and Efficiency

  2024cites this paper
• A Unified Framework for Combinatorial Optimization Based on Graph Neural Networks

  2024cites this paper
• Multi-user Norm Consensus

  2024cites this paper
• M^3RS: Multi-robot, Multi-objective, and Multi-mode Routing and Scheduling

  2024cites this paper
• Tackling Prevalent Conditions in Unsupervised Combinatorial Optimization: Cardinality, Minimum, Covering, and More

  2024cites this paper
• On Reducing Space Amplification with Multi-Column Compaction in Apache IoTDB

  2024cites this paper
• Light-MILPopt: Solving Large-scale Mixed Integer Linear Programs with Lightweight Optimizer and Small-scale Training Dataset

  2024cites this paper
• Sparse Sampling-Based View Planning for Complex Geometries

  2024cites this paper
• A Surprisal-Based Greedy Heuristic for the Set Covering Problem

  2023influential citation
• Named Entity Resolution in Personal Knowledge Graphs

  2023cites this paper
• Optimal Location of Emergency Facility Sites for Railway Dangerous Goods Transportation under Uncertain Conditions

  2023cites this paper
• AWEsome-Cache: Dependency-Free Rule-Caching for Arbitrary Wildcard Patterns in TCAM

  2023cites this paper
• Remote Sensing Image Retrieval Algorithm for Dense Data

  2023cites this paper
• Amplidiff: an optimized amplicon sequencing approach to estimating lineage abundances in viral metagenomes

  2023cites this paper
• Capturing Hiders with Moving Obstacles

  2023cites this paper
• Graph Optimized Data Offloading for Crowd-AI Hybrid Urban Tracking in Intelligent Transportation Systems

  2023cites this paper
• Sequential Decision-Making Framework for Robotic Mobile Fulfillment System-Based Automated Kitting System

  2023cites this paper
• Quantum Annealing with Inequality Constraints: The Set Cover Problem

  2023cites this paper
• Adaptive Tracing and Fault Injection based Fault Diagnosis for Open Source Server Software

  2023cites this paper
• Bi-criteria set covering problem with conflict constraints

  2023cites this paper
• The Equitable Controller Placement Problem

  2023cites this paper
• GNN&GBDT-Guided Fast Optimizing Framework for Large-scale Integer Programming

  2023cites this paper
• A Variational Neural Architecture for Skill-based Team Formation

  2023cites this paper
• The Field Technician Scheduling Problem with Experience-Dependent Service Times

  2023cites this paper
• Understanding user intent modeling for conversational recommender systems: a systematic literature review

  2023cites this paper
• Robust min-max regret covering problems

  2022cites this paper
• An optimisation based approach to neighbourhood search

  2022cites this paper
• Exact and Heuristics Algorithms for Screen Line Problem in Large Size Networks: Shortest Path-Based Column Generation Approach

  2022cites this paper
• A heuristic for the non-unicost set covering problem using local branching

  2022cites this paper
• Data-Driven Loop Bound Learning for Termination Analysis

  2022cites this paper
• The Neural-Prediction based Acceleration Algorithm of Column Generation for Graph-Based Set Covering Problems

  2022cites this paper
• Binary Fruit Fly Swarm Algorithms for the Set Covering Problem

  2022cites this paper
• Can greedy-like heuristics be useful for solving the Weighted Orthogonal Art Gallery Problem under regular grid discretization?

  2022cites this paper
• A heuristic for set covering using neighbourhood search optimisation

  2022cites this paper
• Finding the minimum number of disks of fixed radius needed to cover a set of points in the plane by MaxiMinMax approach

  2022cites this paper
• Data-driven Abstractions for Verification of Deterministic Systems

  2022cites this paper
• AFETM: Adaptive function execution trace monitoring for fault diagnosis

  2022influential citation
• Joint Resource Dimensioning and Placement for Dependable Virtualized Services in Mobile Edge Clouds

  2022cites this paper
• Establishment of Wildfire Monitor-Repeater-EOC System Based on TOPSIS and Genetic Algorithm

  2022cites this paper
• Uma Estratégia Bioinspirada para Escalonamento em Redes Sem Fio sob o Modelo SINR

  2022cites this paper
• Online Set Cover with Happiness Costs

  2021cites this paper
• Acceptance testing based test case prioritization

  2021cites this paper
• A Self-Adaptive Cuckoo Search Algorithm Using a Machine Learning Technique

  2021cites this paper
• Genetic Algorithm with Approximation Algorithm Based Initial Population for the Set Covering Problem

  2021cites this paper
• Weighting-based Variable Neighborhood Search for Optimal Camera Placement

  2021cites this paper
• Modeling Communication Reliability in LoRa Networks with Device-level Accuracy

  2021cites this paper
• An Efficient Branch-and-Bound Solver for Hitting Set

  2021cites this paper
• A new hybrid matheuristic of GRASP and VNS based on constructive heuristics, set-covering and set-partitioning formulations applied to the capacitated vehicle routing problem

  2021cites this paper
• Tourism Service Auction Market for Saudi Arabia

  2021cites this paper
• Development of knowledge testing systems based on discrete optimization models

  2020cites this paper
• Combinatorial Optimization of Graphical User Interface Designs

  2020cites this paper
• Optimization and Learning: Third International Conference, OLA 2020, Cádiz, Spain, February 17–19, 2020, Proceedings

  2020influential citation
• Evaluation of Machine Learning Models for Predicting Antimicrobial Resistance of Actinobacillus pleuropneumoniae From Whole Genome Sequences

  2020cites this paper
• Development and Research of Algorithms for the Formation of an Optimal Individual Educational Path for Online Courses

  2020cites this paper
• A Heuristic Algorithm for the Set k-Cover Problem

  2020cites this paper
• Modeling law search as prediction

  2020cites this paper
• Development of set covering model for determining the open /closed facilities location and resizing capacity of fasilities

  2020cites this paper
• A Comprehensive Survey on the Ambulance Routing and Location Problems

  2020cites this paper
• Modeling law search as prediction

  2020cites this paper
• The Algorithm Design Manual

  2020cites this paper
• An exact method for shrinking pivot tables

  2020cites this paper
• Relational Database Design and Multi-Objective Database Queries for Position Navigation and Timing Data

  2020cites this paper
• Exploring Further Advantages in an Alternative Formulation for the Set Covering Problem

  2020cites this paper
• The greedy randomized adaptive search procedure method in formulating set covering model on cutting stock problem

  2020cites this paper
• Improving emergency preparedness to cascading disasters: A case‐driven risk ontology modelling

  2020cites this paper
• Clustering-Based Binarization Methods Applied to the Crow Search Algorithm for 0/1 Combinatorial Problems

  2020cites this paper
• Optimized Multi-Walk Algorithm for Test Case Reduction

  2020cites this paper