On the public citation graph

Tabu search for maximal constraint satisfaction problems

https://doi.org/10.1007/bfb0017440
0 signed · 48 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-60299-2_7openalex-snapshot
Optimization-based heuristics for maximal constraint satisfaction
inferredcites →https://doi.org/10.1007/3-540-61551-2_70openalex-snapshot
Local search and the number of solutions
inferredcites →https://doi.org/10.1007/3-540-61551-2_75openalex-snapshot
Empirical studies of heuristic local search for constraint solving
inferredcites →https://doi.org/10.1007/3-540-61551-2_95openalex-snapshot
Analysis of heuristic methods for partial constraint satisfaction problems
inferredcites →https://doi.org/10.1007/bf02125407openalex-snapshot
Genetic and hybrid algorithms for graph coloring
inferredcites →https://doi.org/10.1007/bf02239976openalex-snapshot
Using tabu search techniques for graph coloring
inferredcites →https://doi.org/10.1007/bf02241270openalex-snapshot
Algorithms for the maximum satisfiability problem
inferredcites →https://doi.org/10.1016/0004-3702(92)90004-hopenalex-snapshot
Partial constraint satisfaction
inferredcites →https://doi.org/10.1016/0004-3702(92)90007-kopenalex-snapshot
Minimizing conflicts: a heuristic repair method for constraint satisfaction and scheduling problems
inferredcites →https://doi.org/10.1016/0004-3702(95)00044-5openalex-snapshot
Phase transitions and the search problem
inferredcites →https://doi.org/10.1016/0022-0000(88)90046-3openalex-snapshot
How easy is local search?
inferredcites →https://doi.org/10.1016/c2013-0-07627-xopenalex-snapshot
Foundations of Constraint Satisfaction
inferredcites →https://doi.org/10.1017/9781009284349.013openalex-snapshot
Constraint Satisfaction
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.2307/2322374openalex-snapshot
Combinatorial Optimization: Algorithms and Complexity.
inferredcites →https://doi.org/10.4018/978-1-59904-849-9openalex-snapshot
Encyclopedia of Artificial Intelligence

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10721187_18openalex-snapshot
Landscapes and the Maximal Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/3-540-45356-3_5openalex-snapshot
An Analysis of the Configuration Space of the Maximal Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_63openalex-snapshot
Interactive Heuristic Search Algorithm
inferred← citeshttps://doi.org/10.1007/978-1-4615-5775-3_29openalex-snapshot
Solving the Progressive Party Problem by Local Search
inferred← citeshttps://doi.org/10.1007/978-3-030-06167-8_2openalex-snapshot
Meta-heuristics and Artificial Intelligence
inferred← citeshttps://doi.org/10.1007/978-3-319-51469-7_28openalex-snapshot
Combining Genetic Algorithm with the Multilevel Paradigm for the Maximum Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1007/978-3-540-30201-8_81openalex-snapshot
Iterative Forward Search Algorithm: Combining Local Search with Maintaining Arc Consistency and a Conflict-Based Statistics
inferred← citeshttps://doi.org/10.1007/978-3-540-45157-0_21openalex-snapshot
University Course Timetabling with Soft Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-78604-7_1openalex-snapshot
Adaptive Tabu Tenure Computation in Local Search
inferred← citeshttps://doi.org/10.1007/978-3-642-23247-3_6openalex-snapshot
Memetic Algorithms in Discrete Optimization
inferred← citeshttps://doi.org/10.1007/978-3-642-23786-7_38openalex-snapshot
A CSP Solver Focusing on fac Variables
inferred← citeshttps://doi.org/10.1007/bfb0095428openalex-snapshot
Finding regions for local repair in partial constraint satisfaction
inferred← citeshttps://doi.org/10.1007/s10288-004-0056-4openalex-snapshot
Solving the frequency assignment problem with polarization by local search and tabu
inferred← citeshttps://doi.org/10.1007/s10462-004-1286-8openalex-snapshot
A Hybrid Framework for Over-Constrained Generalized
inferred← citeshttps://doi.org/10.1016/j.cor.2005.07.028openalex-snapshot
A survey of local search methods for graph coloring
inferred← citeshttps://doi.org/10.1016/j.cor.2015.07.010openalex-snapshot
Genetic based discrete particle swarm optimization for Elderly Day Care Center timetabling
inferred← citeshttps://doi.org/10.1016/j.dam.2006.04.043openalex-snapshot
Solution techniques for the Large Set Covering Problem
inferred← citeshttps://doi.org/10.1016/j.eswa.2011.01.098openalex-snapshot
A cellular learning automata-based algorithm for solving the vertex coloring problem
inferred← citeshttps://doi.org/10.1016/s0004-3702(01)00174-6openalex-snapshot
Multi-agent oriented constraint satisfaction
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80009-xopenalex-snapshot
Local Search Methods
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1023/a:1011454308633openalex-snapshot
Random Constraint Satisfaction: Flaws and Structure
inferred← citeshttps://doi.org/10.1023/a:1015157615164openalex-snapshot
A New Approach for Weighted Constraint Satisfaction
inferred← citeshttps://doi.org/10.1023/b:jmma.0000026709.24659.daopenalex-snapshot
A General Approach for Constraint Solving by Local Search
inferred← citeshttps://doi.org/10.1080/03155986.2001.11732431openalex-snapshot
An Improved Tabu Search Method For The Weighted Constraint Satisfaction Problem
inferred← citeshttps://doi.org/10.1109/iat.2005.127openalex-snapshot
Solving Generalized Open Constraint Optimization Problem Using Two-level Multi-agent Framework
inferred← citeshttps://doi.org/10.1142/s0218001401000988openalex-snapshot
ALIFE: A MULTIAGENT COMPUTING PARADIGM FOR CONSTRAINT SATISFACTION PROBLEMS
inferred← citeshttps://doi.org/10.1145/1570256.1570405openalex-snapshot
Ant colony optimization
inferred← citeshttps://doi.org/10.1155/2015/637809openalex-snapshot
A Variable Depth Search Algorithm for Binary Constraint Satisfaction Problems
inferred← citeshttps://doi.org/10.4114/ia.v7i20.372openalex-snapshot
Introduction to constraint programming
inferred← citeshttps://doi.org/10.5120/13500-1248openalex-snapshot
A Meta-heuristically Approach of the Spatial Assignment Problem of Human Resources in Multi-sites Enterprise
inferred← citeshttps://doi.org/10.5772/intechopen.78299openalex-snapshot
A Multilevel Genetic Algorithm for the Maximum Satisfaction Problem
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.