On the public citation graph

Differentiable Invariants

https://doi.org/10.1007/11889205_43
0 signed · 29 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/11889205_47openalex-snapshot
Inferring Variable Conflicts for Local Search
inferredcites →https://doi.org/10.1007/978-3-319-07124-4_7openalex-snapshot
Constraint-Based Local Search
inferredcites →https://doi.org/10.1007/978-3-319-07153-4_7-1openalex-snapshot
Constraint-Based Local Search
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_28openalex-snapshot
The Challenge of Generating Spatially Balanced Scientific Experiment Designs
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_7openalex-snapshot
Constraint-Based Combinators for Local Search
inferredcites →https://doi.org/10.1007/bfb0017443openalex-snapshot
Localizer A modeling language for local search
inferredcites →https://doi.org/10.1023/a:1009818401322openalex-snapshot
Localizer
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/582419.582430openalex-snapshot
A constraint-based architecture for local search
inferredcites →https://doi.org/10.1287/ijoc.14.4.345.2826openalex-snapshot
Constraint and Integer Programming in OPL

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470612309.ch18openalex-snapshot
Growing COMET
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_7openalex-snapshot
Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07124-4_7openalex-snapshot
Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_7-1openalex-snapshot
Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_7-2openalex-snapshot
Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-319-59776-8_6openalex-snapshot
In Search of Balance: The Challenge of Generating Balanced Latin Rectangles
inferred← citeshttps://doi.org/10.1007/978-3-642-01929-6_27openalex-snapshot
A Hybrid LS/CP Approach to Solve the Weekly Log-Truck Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_12openalex-snapshot
Memoisation for Constraint-Based Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_61openalex-snapshot
Constraint-Based Local Search for the Automatic Generation of Architectural Tests
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_20openalex-snapshot
On the Design of the Next Generation Access Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_49openalex-snapshot
Kangaroo: An Efficient Constraint-Based Local Search System Using Lazy Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_40openalex-snapshot
Towards Solver-Independent Propagators
inferred← citeshttps://doi.org/10.1007/978-3-662-43505-2_62openalex-snapshot
Integration of Metaheuristics and Constraint Programming
inferred← citeshttps://doi.org/10.1007/s10601-007-9021-0openalex-snapshot
Generic Incremental Algorithms for Local Search
inferred← citeshttps://doi.org/10.1007/s10601-015-9212-zopenalex-snapshot
Constraints for membership in formal languages under systematic search and stochastic local search
inferred← citeshttps://doi.org/10.1007/s10732-017-9353-xopenalex-snapshot
Constraint-based search for optimal Golomb rulers
inferred← citeshttps://doi.org/10.1016/j.cor.2011.02.002openalex-snapshot
A heuristic to solve the synchronized log-truck scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ic.2008.12.001openalex-snapshot
Revisiting constraint-directed search
inferred← citeshttps://doi.org/10.3233/fi-2011-401openalex-snapshot
An automaton Constraint for Local Search
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.