On the public citation graph

An Empirical Analysis of Search in GSAT

0 signed · 55 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/rsa.3240030402openalex-snapshot
Large Cliques Elude the Metropolis Process
inferredcites →https://doi.org/10.1007/978-1-4757-5362-2_14openalex-snapshot
Experimental Analysis of Algorithms
inferredcites →https://doi.org/10.1016/0020-0190(92)90029-uopenalex-snapshot
On the greedy algorithm for satisfiability
inferredcites →https://doi.org/10.1016/0378-4754(88)90023-7openalex-snapshot
Simulated annealing: theory and applications.
inferredcites →https://doi.org/10.1090/dimacs/026/26openalex-snapshot
Simulated annealing for hard satisfiability problems
inferredcites →https://doi.org/10.1109/sfcs.1993.366878openalex-snapshot
Simulated annealing for graph bisection
inferredcites →https://doi.org/10.1145/130836.130837openalex-snapshot
Efficient local search for very large-scale satisfiability problems
inferredcites →https://doi.org/10.1287/opre.42.2.201openalex-snapshot
Needed: An Empirical Science of Algorithms
inferredcites →https://doi.org/10.21236/ada188528openalex-snapshot
Experimental Analysis of Algorithms.

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/0-306-48332-7_277openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/11844297_101openalex-snapshot
Model Complexity vs. Performance in the Bayesian Optimization Algorithm
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_15openalex-snapshot
Accelerating Random Walks
inferred← citeshttps://doi.org/10.1007/3-540-49795-1_19openalex-snapshot
Heuristics for Improving the Non-oblivious Local Search for MaxSAT
inferred← citeshttps://doi.org/10.1007/3-540-60428-6_2openalex-snapshot
A new continuous propositional logic
inferred← citeshttps://doi.org/10.1007/3-540-61551-2_70openalex-snapshot
Local search and the number of solutions
inferred← citeshttps://doi.org/10.1007/3-540-61708-6_53openalex-snapshot
Solving hard combinatorial problems with GSAT — A case study
inferred← citeshttps://doi.org/10.1007/3540634932_27openalex-snapshot
Tabu search vs. Random walk
inferred← citeshttps://doi.org/10.1007/978-0-387-74759-0_364openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-1-4613-0303-9_2openalex-snapshot
Approximate Algorithms and Heuristics for MAX-SAT
inferred← citeshttps://doi.org/10.1007/978-3-030-54621-2_364-1openalex-snapshot
Maximum Satisfiability Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-24838-5_15openalex-snapshot
How to Tell a Good Neighborhood from a Bad One: Satisfiability of Boolean Formulas
inferred← citeshttps://doi.org/10.1007/978-3-540-92695-5_15openalex-snapshot
Tuning Local Search by Average-Reward Reinforcement Learning
inferred← citeshttps://doi.org/10.1007/978-3-642-02777-2_26openalex-snapshot
A Theoretical Analysis of Search in GSAT
inferred← citeshttps://doi.org/10.1007/978-3-642-03751-1_3openalex-snapshot
Estimating Bounds on Expected Plateau Size in MAXSAT Problems
inferred← citeshttps://doi.org/10.1007/bf02947312openalex-snapshot
An algorithm based on tabu search for satisfiability problem
inferred← citeshttps://doi.org/10.1007/bfb0023913openalex-snapshot
GenSAT: A navigational approach
inferred← citeshttps://doi.org/10.1007/s10479-007-0229-6openalex-snapshot
A machine learning approach to algorithm selection for $\mathcal{NP}$ -hard optimization problems: a case study on the MPE problem
inferred← citeshttps://doi.org/10.1007/s10732-007-9023-5openalex-snapshot
Modelling the dynamics of stochastic local search on k-sat
inferred← citeshttps://doi.org/10.1007/s11390-005-0002-8openalex-snapshot
Penalty Formulations and Trap-Avoidance Strategies for Solving Hard Satisfiability Problems
inferred← citeshttps://doi.org/10.1016/b978-155860872-6/50030-5openalex-snapshot
BIBLIOGRAPHY
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.12.098openalex-snapshot
A multilevel tabu search algorithm for the feature selection problem in biomedical data
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00048-xopenalex-snapshot
Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00310-5openalex-snapshot
Balance and Filtering in Structured Satisfiable Problems (Preliminary Report)
inferred← citeshttps://doi.org/10.1023/a:1006350622830openalex-snapshot
Local Search Algorithms for SAT: An Empirical Evaluation
inferred← citeshttps://doi.org/10.1023/a:1006558104682openalex-snapshot
A Glimpse of Constraint Satisfaction
inferred← citeshttps://doi.org/10.1063/1.5032056openalex-snapshot
About approximation of integer factorization problem by the combination fixed-point iteration method and Bayesian rounding for quantum cryptography
inferred← citeshttps://doi.org/10.1080/0952813021000028621openalex-snapshot
A case study in the meta-reasoning procedure ND
inferred← citeshttps://doi.org/10.1093/jigpal/8.3.293openalex-snapshot
An analysis of empirical testing for modal decision procedures
inferred← citeshttps://doi.org/10.1103/physreve.59.3983openalex-snapshot
Relaxation in graph coloring and satisfiability problems
inferred← citeshttps://doi.org/10.1109/enc.2005.22openalex-snapshot
Hard Problem Generation for MKP
inferred← citeshttps://doi.org/10.1109/tsmca.2002.1021106openalex-snapshot
Dynamics of local search heuristics for the traveling salesman problem
inferred← citeshttps://doi.org/10.1145/1052934.1052941openalex-snapshot
Learning algorithms for single-instance electronic negotiations using the time-dependent behavioral tactic
inferred← citeshttps://doi.org/10.1145/264216.264220openalex-snapshot
Reactive search, a history-sensitive heuristic for MAX-SAT
inferred← citeshttps://doi.org/10.1145/3583131.3590491openalex-snapshot
To slide or not to slide? Moving along fitness levels and preserving the gene subsets diversity in modern evolutionary computation
inferred← citeshttps://doi.org/10.1162/evco.1995.3.3.267openalex-snapshot
Tackling Car Sequencing Problems Using a Generic Genetic Algorithm
inferred← citeshttps://doi.org/10.1287/opre.42.2.201openalex-snapshot
Needed: An Empirical Science of Algorithms
inferred← citeshttps://doi.org/10.14288/1.0051395openalex-snapshot
Understanding stochastic local search algorithms : an empirical analysis of the relationship between search space structure and algorithm behaviour
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8668openalex-snapshot
Greedy or Not? Best Improving versus First Improving Stochastic Local Search for MAXSAT
inferred← citeshttps://doi.org/10.1609/socs.v1i1.18168openalex-snapshot
Directed Plateau Search for MAX-k-SAT
inferred← citeshttps://doi.org/10.1613/jair.445openalex-snapshot
When Gravity Fails: Local Search Topology
inferred← citeshttps://doi.org/10.1613/jair.711openalex-snapshot
Backbone Fragility and the Local Search Cost Peak
inferred← citeshttps://doi.org/10.20965/jaciii.2006.p0260openalex-snapshot
Testing Hypotheses on Simulated Data: Why Traditional Hypotheses-Testing Statistics Are Not Always Adequate for Simulated Data, and How to Modify Them
inferred← citeshttps://doi.org/10.22028/d291-25781openalex-snapshot
Domain-independent local search for linear integer optimization
inferred← citeshttps://doi.org/10.48550/arxiv.1301.7383openalex-snapshot
Evaluating Las Vegas Algorithms - Pitfalls and Remedies
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.