An improved configuration checking-based algorithm for the unicost set covering problem
From MaRDI portal
Publication:2239985
DOI10.1016/j.ejor.2021.02.015zbMath1487.90573OpenAlexW3128544032MaRDI QIDQ2239985
Sameh Al-Shihabi, Yiyuan Wang, Shiwei Pan, Junping Zhou, Minghao Yin, Nan Yang
Publication date: 5 November 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.02.015
combinatorial optimizationlocal searchelement state-based configuration checkingmulti-level scoring functionunicost set covering
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An efficient local search heuristic with row weighting for the unicost set covering problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set \(k\)-covering
- A hybrid heuristic for the set covering problem
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- A GRASP algorithm to solve the unicost set covering problem
- A column generation and branch-and-cut algorithm for the channel assignment problem
- An electromagnetism metaheuristic for the unicost set covering problem
- Computational experience with general cutting planes for the set covering problem
- A probabilistic heuristic for a computationally difficult set covering problem
- Enhancing an algorithm for set covering problems
- A genetic algorithm for the set covering problem
- Computational experience with approximation algorithms for the set covering problem
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- A Lagrangian-based heuristic for large-scale set covering problems
- State space relaxation for set covering problems related to bus driver scheduling
- An algorithm for set covering problem
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Multi-trip time-dependent vehicle routing problem with time windows
- Near-linear algorithms for geometric hitting sets and set covers
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- TTT plots: a perl program to create time-to-target plots
- Tight approximability results for test set problems in bioinformatics
- A 3-flip neighborhood local search for the set covering problem
- The set covering problem revisited: an empirical study of the value of dual information
- Minimal diagnosis and diagnosability of discrete-event systems modeled by automata
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- An efficient heuristic for large set covering problems
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A Greedy Heuristic for the Set-Covering Problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- NuMVC: An Efficient Local Search Algorithm for Minimum Vertex Cover
- A Heuristic Method for the Set Covering Problem
- Finding A Small Vertex Cover in Massive Sparse Graphs: Construct, Local Search, and Preprocess
- MLQCC: an improved local search algorithm for the set k‐covering problem
This page was built for publication: An improved configuration checking-based algorithm for the unicost set covering problem
