On the public citation graph
An algorithm based on tabu search for satisfiability problem
0 signed · 19 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.1007/bf02948732openalex-snapshot
Onk-positive satisfiability problem
inferredcites →https://doi.org/10.1016/s0004-3702(99)00048-xopenalex-snapshot
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
inferredcites →https://doi.org/10.1090/dimacs/026/26openalex-snapshot
Simulated annealing for hard satisfiability problems
inferredcites →https://doi.org/10.1145/130836.130837openalex-snapshot
Efficient local search for very large-scale satisfiability problems
inferredcites →https://doi.org/10.1145/321033.321034openalex-snapshot
A Computing Procedure for Quantification Theory
inferredcites →https://doi.org/10.1177/003463733503200203openalex-snapshot
The Search For Satisfaction
inferredcites →https://doi.org/10.1613/jair.7openalex-snapshot
An Empirical Analysis of Search in GSAT
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/11499107_15openalex-snapshot
Random Walk with Continuously Smoothed Variable Weights
inferred← citeshttps://doi.org/10.1007/978-3-319-19647-3_25openalex-snapshot
Local Search to Approximate Max NAE-$$k$$-Sat Tightly
inferred← citeshttps://doi.org/10.1007/s10462-009-9136-3openalex-snapshot
Improving GASAT by replacing tabu search by DLM and enhancing the best members
inferred← citeshttps://doi.org/10.1007/s10878-016-0015-yopenalex-snapshot
Tabu search for the real-world carpooling problem
inferred← citeshttps://doi.org/10.1007/s10878-016-0040-xopenalex-snapshot
Introduction: Special issue dedicated to the memory of professor Wenqi Huang
inferred← citeshttps://doi.org/10.1007/s11390-017-1802-3openalex-snapshot
Greedy Randomized Adaptive Search Procedure with Path-Relinking for the Vertex p-Center Problem
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.07.012openalex-snapshot
Comparing the performance of the genetic and local search algorithms for solving the satisfiability problems
inferred← citeshttps://doi.org/10.1016/j.cor.2003.12.006openalex-snapshot
An effective hybrid algorithm for the problem of packing circles into a larger containing circle
inferred← citeshttps://doi.org/10.1016/j.tcs.2016.05.040openalex-snapshot
Approximating Max NAE-k-SAT by anonymous local search
inferred← citeshttps://doi.org/10.1109/itnec.2016.7560401openalex-snapshot
A genetic-based local search method for SAT problem
inferred← citeshttps://doi.org/10.1504/ijaip.2013.056447openalex-snapshot
A survey of the satisfiability-problems solving algorithms
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.