On the public citation graph

Caching Search States in Permutation Problems

https://doi.org/10.1007/11564751_47
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/11564751openalex-snapshot
Principles and Practice of Constraint Programming - CP 2005
inferredcites →https://doi.org/10.1007/11564751_21openalex-snapshot
Conditional Symmetry Breaking
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_70openalex-snapshot
Unrestricted Nogood Recording in CSP Search
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1007/bf00940554openalex-snapshot
Optimal scheduling in film production to minimize talent hold cost
inferredcites →https://doi.org/10.1007/bf00941894openalex-snapshot
Wiener-hopf equations and variational inequalities
inferredcites →https://doi.org/10.1016/j.cor.2005.01.018openalex-snapshot
Modelling and solving English Peg Solitaire
inferredcites →https://doi.org/10.1016/s0305-0548(98)80001-4openalex-snapshot
Applications of modern heuristic search methods to pattern sequencing problems
inferredcites →https://doi.org/10.1180/minmag.1994.58a.1.154openalex-snapshot
Carbon Dioxide Fugacities at High Temperature and Pressure
inferredcites →https://doi.org/10.1613/jair.1351openalex-snapshot
Dual Modelling of Permutation and Injection Problems

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-319-07455-9_22openalex-snapshot
A Branch-and-Bound Algorithm for the Talent Scheduling Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_31openalex-snapshot
Machine Learning of Bayesian Networks Using Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_10openalex-snapshot
Automatically Exploiting Subproblem Equivalence in Constraint Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-21434-9_4openalex-snapshot
Case-Based Reasoning for Autonomous Constraint Solving
inferred← citeshttps://doi.org/10.1007/s10601-011-9112-9openalex-snapshot
Exploiting subproblem dominance in constraint programming
inferred← citeshttps://doi.org/10.1007/s10601-014-9175-5openalex-snapshot
A method for detecting symmetries in constraint models and its generalisation
inferred← citeshttps://doi.org/10.1007/s10601-024-09374-7openalex-snapshot
Limiting the memory consumption of caching for detecting subproblem dominance in constraint problems
inferred← citeshttps://doi.org/10.1016/j.artint.2012.02.001openalex-snapshot
A complete solution to the Maximum Density Still Life Problem
inferred← citeshttps://doi.org/10.1016/j.cie.2018.10.028openalex-snapshot
A generalized variable neighborhood search algorithm for the talent scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2015.10.002openalex-snapshot
An enhanced branch-and-bound algorithm for the talent scheduling problem
inferred← citeshttps://doi.org/10.1109/kse56063.2022.9953796openalex-snapshot
An Iterated Local Search for the Talent Scheduling Problem with Location Costs
inferred← citeshttps://doi.org/10.1109/tsmc.2019.2916202openalex-snapshot
Enhanced Branch-and-Bound Framework for a Class of Sequencing Problems
inferred← citeshttps://doi.org/10.1145/3468264.3468566openalex-snapshot
Generating efficient solvers from constraint models
inferred← citeshttps://doi.org/10.1287/ijoc.1090.0378openalex-snapshot
Solving Talent Scheduling with Dynamic Programming
inferred← citeshttps://doi.org/10.24963/ijcai.2019/160openalex-snapshot
Optimizing Constraint Solving via Dynamic Programming
inferred← citeshttps://doi.org/10.26180/4546099openalex-snapshot
Automatic symmetry detection and dynamic symmetry breaking for constraint programming
inferred← citeshttps://doi.org/10.4230/lipics.cp.2026.54openalex-snapshot
On Symmetries and Transformations
inferred← citeshttps://doi.org/10.48550/arxiv.1401.5869openalex-snapshot
An Enhanced Branch-and-bound Algorithm for the Talent Scheduling Problem
inferred← citeshttps://doi.org/10.5555/1365527.1365533openalex-snapshot
Search in the patience game ‘Black Hole’
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.