On the public citation graph

Evolving Variable-Ordering Heuristics for Constrained Optimisation

https://doi.org/10.1007/11564751_54
0 signed · 23 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.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_35openalex-snapshot
The Adaptive Constraint Engine
inferredcites →https://doi.org/10.1007/978-1-4757-4137-7_25openalex-snapshot
Choosing Search Heuristics by Non-Stationary Reinforcement Learning
inferredcites →https://doi.org/10.1007/978-3-540-24855-2_59openalex-snapshot
Evolving Local Search Heuristics for SAT Using Genetic Programming
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_50openalex-snapshot
Efficient Strategies for (Weighted) Maximum Satisfiability
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1007/bf00143877openalex-snapshot
Automatically configuring constraint satisfaction programs: A case study
inferredcites →https://doi.org/10.1016/0004-3702(94)00042-yopenalex-snapshot
Inductive functional programming using incremental program transformation
inferredcites →https://doi.org/10.1023/a:1006351428454openalex-snapshot
Implementing the Davis–Putnam Method
inferredcites →https://doi.org/10.1023/a:1009725216438openalex-snapshot
A Two-Phase Exact Algorithm for MAX-SAT and Weighted MAX-SAT Problems
inferredcites →https://doi.org/10.1109/4235.585893openalex-snapshot
No free lunch theorems for optimization
inferredcites →https://doi.org/10.1109/cec.2003.1299949openalex-snapshot
An investigation of a tabu assisted hyper-reuristic genetic algorithm

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11589990_142openalex-snapshot
A Comparison of Evolutionary Methods for the Discovery of Local Search Heuristics
inferred← citeshttps://doi.org/10.1007/978-3-642-15396-9_27openalex-snapshot
Ensemble Classification for Constraint Solver Configuration
inferred← citeshttps://doi.org/10.1016/j.orp.2020.100177openalex-snapshot
Multi-objective evolutionary search strategies in constraint programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80008-8openalex-snapshot
Backtracking Search Algorithms
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1109/ictai.2007.54openalex-snapshot
Determining the Basis for Performance Variations in CSP Heuristics
inferred← citeshttps://doi.org/10.1109/ictai.2007.87openalex-snapshot
Design of OBF-TS Fuzzy Models Based on Multiple Clustering Validity Criteria
inferred← citeshttps://doi.org/10.1371/annotation/2a72b19b-2c45-4d7e-8f3c-582eb1f57af8openalex-snapshot
Correction: Automatically Generated Algorithms for the Vertex Coloring Problem
inferred← citeshttps://doi.org/10.1371/journal.pone.0058551openalex-snapshot
Automatically Generated Algorithms for the Vertex Coloring Problem
inferred← citeshttps://doi.org/10.1561/9781680838992openalex-snapshot
Machine Learning for Automated Theorem Proving: Learning to Solve SAT and QSAT
inferred← citeshttps://doi.org/10.25904/1912/1794openalex-snapshot
Evolving Algorithms for Over-Constrained and Satisfaction Problems
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.