On the public citation graph

Nondeterministic Control for Hybrid Search

https://doi.org/10.1007/11493853_28
0 signed · 31 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-49481-2_23openalex-snapshot
Salsa: A Language for Search Algorithms
inferredcites →https://doi.org/10.1007/3-540-49481-2_30openalex-snapshot
Using Constraint Programming and Local Search Methods to Solve Vehicle Routing Problems
inferredcites →https://doi.org/10.1007/978-3-540-24664-0_22openalex-snapshot
Scheduling Abstractions for Local Search
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/978-3-540-45193-8_5openalex-snapshot
Control Abstractions for Local Search
inferredcites →https://doi.org/10.1007/978-3-540-48085-3_25openalex-snapshot
Search Procedures and Parallelism in Constraint Programming
inferredcites →https://doi.org/10.1007/bfb0017464openalex-snapshot
Programming constraint inference engines
inferredcites →https://doi.org/10.1007/s10601-005-0553-xopenalex-snapshot
Control Abstractions for Local Search
inferredcites →https://doi.org/10.1007/s10601-005-2811-3openalex-snapshot
Contraint-Based Combinators for Local Search
inferredcites →https://doi.org/10.1023/a:1013661617536openalex-snapshot
Using Constraint-Based Operators to Solve the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.1145/359496.359529openalex-snapshot
Search and strategies in OPL
inferredcites →https://doi.org/10.1145/582419.582430openalex-snapshot
A constraint-based architecture for local search
inferredcites →https://doi.org/10.1145/976706.976714openalex-snapshot
A decomposition-based implementation of search strategies
inferredcites →https://doi.org/10.1287/mnsc.42.6.797openalex-snapshot
A Fast Taboo Search Algorithm for the Job Shop Problem
inferredcites →https://doi.org/10.1287/mnsc.44.2.262openalex-snapshot
Guided Local Search with Shifting Bottleneck for Job Shop Scheduling
inferredcites →https://doi.org/10.1287/trsc.1030.0049openalex-snapshot
A Two-Stage Hybrid Local Search for the Vehicle Routing Problem with Time Windows
inferredcites →https://doi.org/10.2307/254202openalex-snapshot
The OPL Optimization Programming Language
inferredcites →https://doi.org/10.7551/mitpress/4304.003.0027openalex-snapshot
Comparing Trailing and Copying for Constraint Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470400531.eorms0088openalex-snapshot
Basic CP Theory: Search
inferred← citeshttps://doi.org/10.1007/11564751_119openalex-snapshot
The Comet Programming Language and System
inferred← citeshttps://doi.org/10.1007/11564751_33openalex-snapshot
Parallel Local Search in Comet
inferred← citeshttps://doi.org/10.1007/11889205_27openalex-snapshot
High-Level Nondeterministic Abstractions in C++
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_4openalex-snapshot
Instantly Turning a Naive Exhaustive Search into Three Efficient Searches with Pruning
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_37openalex-snapshot
Parallelizing Constraint Programs Transparently
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_5openalex-snapshot
The Objective-CP Optimization System
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-009-9075-2openalex-snapshot
Redundant modeling in permutation weighted constraint satisfaction problems
inferred← citeshttps://doi.org/10.1007/s10601-016-9242-1openalex-snapshot
A microkernel architecture for constraint programming
inferred← citeshttps://doi.org/10.1016/j.cor.2008.08.014openalex-snapshot
Parallel and distributed local search in COMET
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5334openalex-snapshot
A Microkernel Architecture for Constraint Programming
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.