An improved configuration checking-based algorithm for the unicost set covering problem
From MaRDI portal
Publication:2239985
Recommendations
- A novel local search algorithm with configuration checking and scoring mechanism for the set k‐covering problem
- An efficient local search heuristic with row weighting for the unicost set covering problem
- Note: A local-search heuristic for large set-covering problems
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- A GRASP algorithm to solve the unicost set covering problem
Cites work
- A 3-flip neighborhood local search for the set covering problem
- A column generation and branch-and-cut algorithm for the channel assignment problem
- A Dynamic Subgradient-Based Branch-and-Bound Procedure for Set Covering
- A genetic algorithm for the set covering problem
- A GRASP algorithm to solve the unicost set covering problem
- A Greedy Heuristic for the Set-Covering Problem
- A Heuristic Method for the Set Covering Problem
- A hybrid heuristic for the set covering problem
- A hybrid Lagrangean heuristic with GRASP and path-relinking for set k-covering
- A Lagrangian-based heuristic for large-scale set covering problems
- A morphing procedure to supplement a simulated annealing heuristic for cost- and coverage-correlated set-covering problems
- A New Approximation Method for Set Covering Problems, with Applications to Multidimensional Bin Packing
- A probabilistic heuristic for a computationally difficult set covering problem
- An algorithm for set covering problem
- An efficient heuristic for large set covering problems
- An efficient local search heuristic with row weighting for the unicost set covering problem
- An electromagnetism metaheuristic for the unicost set covering problem
- Approximation Algorithms for the Set Covering and Vertex Cover Problems
- CCLS: An Efficient Local Search Algorithm for Weighted Maximum Satisfiability
- Compact formulations and an iterated local search-based matheuristic for the minimum weighted feedback vertex set problem
- Comparison of genetic algorithms, random restart and two-opt switching for solving large location-allocation problems
- Computational experience with approximation algorithms for the set covering problem
- Computational experience with general cutting planes for the set covering problem
- Enhancing an algorithm for set covering problems
- Finding a small vertex cover in massive sparse graphs: construct, local search, and preprocess
- scientific article; zbMATH DE number 3550465 (Why is no real title available?)
- scientific article; zbMATH DE number 4121754 (Why is no real title available?)
- Improving configuration checking for satisfiable random \(k\)-SAT instances
- Local Search for Minimum Weight Dominating Set with Two-Level Configuration Checking and Frequency Based Scoring Function
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover
- Minimal diagnosis and diagnosability of discrete-event systems modeled by automata
- MLQCC: an improved local search algorithm for the set k‐covering problem
- Multi-trip time-dependent vehicle routing problem with time windows
- Near-linear algorithms for geometric hitting sets and set covers
- NuMVC: an efficient local search algorithm for minimum vertex cover
- Optimal Solution of Set Covering/Partitioning Problems Using Dual Heuristics
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- State space relaxation for set covering problems related to bus driver scheduling
- Tabu search-based metaheuristic algorithm for large-scale set covering problems
- The set covering problem revisited: an empirical study of the value of dual information
- Tight approximability results for test set problems in bioinformatics
- TTT plots: a perl program to create time-to-target plots
Cited in
(2)
This page was built for publication: An improved configuration checking-based algorithm for the unicost set covering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2239985)
