On the public citation graph

Localizer A modeling language for local search

https://doi.org/10.1007/bfb0017443
0 signed · 54 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-61756-6_101openalex-snapshot
Models for using stochastic constraint solvers in constraint logic programming
inferredcites →https://doi.org/10.1109/tassp.1984.1164450openalex-snapshot
Combinatorial optimization:Algorithms and complexity
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1287/ijoc.1.3.190openalex-snapshot
Tabu Search—Part I
inferredcites →https://doi.org/10.1287/opre.39.3.378openalex-snapshot
Optimization by Simulated Annealing: An Experimental Evaluation; Part II, Graph Coloring and Number Partitioning
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.5860/choice.35-3926openalex-snapshot
Numerica: a modeling language for global optimization
inferredcites →https://doi.org/10.7551/mitpress/5073.001.0001openalex-snapshot
Numerica

What points at this work

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

inferred← citeshttps://doi.org/10.1002/(sici)1097-024x(200003)30:3<233::aid-spe297>3.3.co;2-bopenalex-snapshot
LOCAL++: A C++ framework for local search algorithms
inferred← citeshttps://doi.org/10.1002/spe.524openalex-snapshot
E ASY L OCAL++ : an object‐oriented framework for the flexible design of local‐search algorithms
inferred← citeshttps://doi.org/10.1007/0-306-48056-5_13openalex-snapshot
Local Search and Constraint Programming
inferred← citeshttps://doi.org/10.1007/11415763_11openalex-snapshot
A Local Search System for Solving Constraint Problems of Declarative Graph-Based Global Constraints
inferred← citeshttps://doi.org/10.1007/11493853_4openalex-snapshot
Set Variables and Local Search
inferred← citeshttps://doi.org/10.1007/11564751_7openalex-snapshot
Incremental Algorithms for Local Search from Existential Second-Order Logic
inferred← citeshttps://doi.org/10.1007/11889205_21openalex-snapshot
When Constraint Programming and Local Search Solve the Scheduling Problem of Electricité de France Nuclear Power Plant Outages
inferred← citeshttps://doi.org/10.1007/11889205_43openalex-snapshot
Differentiable Invariants
inferred← citeshttps://doi.org/10.1007/11889205_54openalex-snapshot
The Modelling Language Zinc
inferred← citeshttps://doi.org/10.1007/3-540-45322-9_5openalex-snapshot
Yet Another Local Search Method for Constraint Solving
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_19openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_11openalex-snapshot
Local Probing Applied to Scheduling
inferred← citeshttps://doi.org/10.1007/3-540-49481-2_23openalex-snapshot
Salsa: A Language for Search Algorithms
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_6openalex-snapshot
Over-Constrained Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_10openalex-snapshot
Open Perspectives
inferred← citeshttps://doi.org/10.1007/978-1-4419-8917-8_6openalex-snapshot
Hybrid Problem Solving in ECLiPSe
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-58253-5_3openalex-snapshot
Combining Neighborhoods into Local Search Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-39866-0_40openalex-snapshot
Separating Search and Strategy in Solver Cooperations
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_13openalex-snapshot
An Overview of HAL
inferred← citeshttps://doi.org/10.1007/978-3-540-48085-3_25openalex-snapshot
Search Procedures and Parallelism in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-69611-7_14openalex-snapshot
From Zinc to Design Model
inferred← citeshttps://doi.org/10.1007/978-3-540-73817-6_1openalex-snapshot
Hybrid Algorithms in Constraint Programming
inferred← citeshttps://doi.org/10.1007/s10472-020-09704-4openalex-snapshot
Real-time solving of computationally hard problems using optimal algorithm portfolios
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/s42979-022-01120-1openalex-snapshot
Defining Parallel Local Search Procedures with Neighborhood Combinators
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.eswa.2011.11.096openalex-snapshot
Sliced Neighborhood Search
inferred← citeshttps://doi.org/10.1016/s1571-0653(05)80106-4openalex-snapshot
Finding the Right Hybrid Algorithm - A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1023/a:1009818401322openalex-snapshot
Localizer
inferred← citeshttps://doi.org/10.1023/a:1014450507312openalex-snapshot
Finding the Right Hybrid Algorithm – A Combinatorial Meta-Problem
inferred← citeshttps://doi.org/10.1023/a:1020565317875openalex-snapshot
SALSA: A Language for Search Algorithms
inferred← citeshttps://doi.org/10.1023/a:1021188818613openalex-snapshot
Improved Local Search for CP Toolkits
inferred← citeshttps://doi.org/10.1109/coase.2005.1506765openalex-snapshot
Coherent configuration and operation of building transportation systems
inferred← citeshttps://doi.org/10.1109/tevc.2002.802449openalex-snapshot
Ants can solve constraint satisfaction problems
inferred← citeshttps://doi.org/10.1109/tools.1999.779008openalex-snapshot
LOCAL++: a C++ framework for local search algorithms
inferred← citeshttps://doi.org/10.22028/d291-25781openalex-snapshot
Domain-independent local search for linear integer optimization
inferred← citeshttps://doi.org/10.3233/fi-2011-401openalex-snapshot
An automaton Constraint for Local Search
inferred← citeshttps://doi.org/10.4018/978-1-4666-2086-5.ch006openalex-snapshot
Investigating of Hybrid Meta-Heuristics to Solve the Large-Scale Multi-Source Weber Problems and Performance Measuring of them with Statistical Tests
inferred← citeshttps://doi.org/10.4172/jcsb.1000063openalex-snapshot
Solver Independent Modelling of Combinatorial and Optimization Problems
inferred← citeshttps://doi.org/10.4204/eptcs.306.59openalex-snapshot
Research Report on Automatic Synthesis of Local Search Neighborhood Operators
inferred← citeshttps://doi.org/10.5897/ijps11.1499openalex-snapshot
ZLoc: A C++ library 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.