On the public citation graph
Local Search Algorithm for Unicost Set Covering Problem
0 signed · 52 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/1520-6750(199002)37:1<151::aid-nav3220370110>3.0.co;2-2openalex-snapshot
A lagrangian heuristic for set-covering problems
inferredcites →https://doi.org/10.1007/b105088openalex-snapshot
SOFSEM 2005: Theory and Practice of Computer Science
inferredcites →https://doi.org/10.1007/bfb0120689openalex-snapshot
Two computationally difficult set covering problems that arise in computing the 1-width of incidence matrices of Steiner triple systems
inferredcites →https://doi.org/10.1007/bfb0120886openalex-snapshot
Set covering algorithms using cutting planes, heuristics, and subgradient optimization: A computational study
inferredcites →https://doi.org/10.1016/0377-2217(87)90141-xopenalex-snapshot
An algorithm for set covering problem
inferredcites →https://doi.org/10.1016/0377-2217(95)00159-xopenalex-snapshot
A genetic algorithm for the set covering problem
inferredcites →https://doi.org/10.1016/s0004-3702(00)00078-3openalex-snapshot
A comparison of structural CSP decomposition methods
inferredcites →https://doi.org/10.1016/s0377-2217(96)00161-0openalex-snapshot
Computational experience with approximation algorithms for the set covering problem
inferredcites →https://doi.org/10.1016/s0377-2217(97)00294-4openalex-snapshot
A tabu search approach to the constraint satisfaction problem as a general problem solver
inferredcites →https://doi.org/10.1057/jors.1996.82openalex-snapshot
A Genetic Algorithm for the Set Covering Problem
inferredcites →https://doi.org/10.1287/moor.4.3.233openalex-snapshot
A Greedy Heuristic for the Set-Covering Problem
inferredcites →https://doi.org/10.2139/ssrn.2832057openalex-snapshot
A New Genetic Algorithm for Set Covering Problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-319-10762-2_24openalex-snapshot
An Immune-Inspired Algorithm for the Set Cover Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5openalex-snapshot
Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_10openalex-snapshot
Improving Cluster-Based Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_4openalex-snapshot
Training Parameterized Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_5openalex-snapshot
ISAC for Algorithm Selection
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_7openalex-snapshot
Training Parallel Solvers
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_8openalex-snapshot
Dynamic Approach for Switching Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-11230-5_9openalex-snapshot
Evolving Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.1007/978-3-319-42007-3_78openalex-snapshot
Binary Harmony Search Algorithm for Solving Set-Covering Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-42085-1_17openalex-snapshot
Solving Biobjective Set Covering Problem Using Binary Cat Swarm Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/s10458-023-09608-7openalex-snapshot
Algorithms for partially robust team formation
inferred← citeshttps://doi.org/10.1007/s10479-016-2229-xopenalex-snapshot
An algorithm for approximating the Pareto set of the multiobjective set covering problem
inferred← citeshttps://doi.org/10.1007/s10559-026-00893-0openalex-snapshot
Applying Algorithm Unions to Specific Classes of Boolean Programming Problems
inferred← citeshttps://doi.org/10.1007/s10601-015-9211-0openalex-snapshot
Efficient search procedures for solving combinatorial problems
inferred← citeshttps://doi.org/10.1007/s11227-010-0470-7openalex-snapshot
EF-MPR, a new energy eFficient multi-point relay selection algorithm for MANET
inferred← citeshttps://doi.org/10.1007/s11590-018-1267-5openalex-snapshot
A tolerance function for the multiobjective set covering problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2018.10.025openalex-snapshot
On the optimal placement of cameras for surveillance and the underlying set cover problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.05.038openalex-snapshot
An efficient local search heuristic with row weighting for the unicost set covering problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2021.02.015openalex-snapshot
An improved configuration checking-based algorithm for the unicost set covering problem
inferred← citeshttps://doi.org/10.1088/0031-9155/56/17/014openalex-snapshot
A set cover approach to fast beam orientation optimization in intensity modulated radiation therapy for total marrow irradiation
inferred← citeshttps://doi.org/10.1109/iceeict.2015.7307523openalex-snapshot
Optimal coverage of Wireless Sensor Network using Termite Colony Optimization Algorithm
inferred← citeshttps://doi.org/10.1109/tase.2013.2271703openalex-snapshot
Degree of Redundancy of Linear Systems Using Implicit Set Covering
inferred← citeshttps://doi.org/10.1155/2013/203032openalex-snapshot
A New Formulation of the Set Covering Problem for Metaheuristic Approaches
inferred← citeshttps://doi.org/10.14569/ijarai.2015.040607openalex-snapshot
A Heuristic Approach for Minimum Set Cover Problem
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5501openalex-snapshot
Representative Solutions for Bi-Objective Optimisation
inferred← citeshttps://doi.org/10.1609/aaai.v35i14.17471openalex-snapshot
Weighting-based Variable Neighborhood Search for Optimal Camera Placement
inferred← citeshttps://doi.org/10.21076/vizyoner.875219openalex-snapshot
Eş Maliyetli Küme Kapsama Problemi İçin Adaptif Gözlem Ağırlıklandırmaya Dayalı Bir Yerel Arama Algoritması Önerisi
inferred← citeshttps://doi.org/10.24963/ijcai.2020/204openalex-snapshot
Two-goal Local Search and Inference Rules for Minimum Dominating Set
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-751openalex-snapshot
ISAC – Instance-Specific Algorithm Configuration
inferred← citeshttps://doi.org/10.3390/sym14010131openalex-snapshot
A Hybrid Shuffled Frog Leaping Algorithm and Its Performance Assessment in Multi-Dimensional Symmetric Function
inferred← citeshttps://doi.org/10.34229/kca2522-9664.26.4.4openalex-snapshot
APPLYING ALGORITHM UNIONS TO SPECIFIC CLASSES OF BOOLEAN PROGRAMMING PROBLEMS
inferred← citeshttps://doi.org/10.3934/jimo.2015.11.575openalex-snapshot
The set covering problem revisited: An empirical study of the value of dual information
inferred← citeshttps://doi.org/10.46254/an11.20210540openalex-snapshot
A Literature Survey on Instance Specific Algorithm Configuration Methods
inferred← citeshttps://doi.org/10.48550/arxiv.1606.02221openalex-snapshot
Multi-resource defensive strategies for patrolling games with alarm systems
inferred← citeshttps://doi.org/10.65109/bcap5841openalex-snapshot
Recoverable Team Formation: Building Teams Resilient to Change
inferred← citeshttps://doi.org/10.70675/a6ba6d8bz6453z4acdz919azb5ff5e67bf07openalex-snapshot
On the optimal placement of cameras for the surveillance of urban events : a real-world, human-assisted combinatorial approach for decision support systems
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.