On the public citation graph

Branch & sample: A simple strategy for constraint satisfaction

https://doi.org/10.1007/bf02219227
0 signed · 28 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/978-3-662-09438-9openalex-snapshot
Principles of Artificial Intelligence
inferredcites →https://doi.org/10.1007/bf00288958openalex-snapshot
Backtracking with multi-level dynamic search rearrangement
inferredcites →https://doi.org/10.1016/0004-3702(77)90007-8openalex-snapshot
Consistency in networks of relations
inferredcites →https://doi.org/10.1016/0004-3702(84)90004-3openalex-snapshot
General Branch and Bound, and its relation to A∗ and AO∗
inferredcites →https://doi.org/10.1016/0020-0190(81)90074-0openalex-snapshot
Solving combinatorial search problems by intelligent backtracking
inferredcites →https://doi.org/10.1016/0360-8352(81)90004-8openalex-snapshot
Computerized facility layout with graph theory
inferredcites →https://doi.org/10.1016/0377-2217(81)90105-3openalex-snapshot
Combinatorial methods of discrete programming
inferredcites →https://doi.org/10.1016/0898-1221(78)90043-3openalex-snapshot
Combinatorial algorithms: Theory and practice
inferredcites →https://doi.org/10.1016/s0004-3702(83)80008-3openalex-snapshot
Consistent-labeling problems and their algorithms: Expected-complexities and theory-based heuristics
inferredcites →https://doi.org/10.1103/revmodphys.58.765openalex-snapshot
Ultrametricity for physicists
inferredcites →https://doi.org/10.1109/proc.1981.12145openalex-snapshot
Principles of artificial intelligence
inferredcites →https://doi.org/10.1145/322290.322292openalex-snapshot
A Sufficient Condition for Backtrack-Free Search
inferredcites →https://doi.org/10.1145/358656.358678openalex-snapshot
Combinatorially implosive algorithms
inferredcites →https://doi.org/10.1145/361219.361224openalex-snapshot
Backtrack programming techniques
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.1287/opre.14.4.699openalex-snapshot
Branch-and-Bound Methods: A Survey
inferredcites →https://doi.org/10.4337/9781800378841.a.17openalex-snapshot
Artificial intelligence
inferredcites →https://doi.org/10.52842/conf.ecaade.1989.x.t9uopenalex-snapshot
Computer Methods in Architectural Problem Solving: Critique and Proposals

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-031-70071-2_2openalex-snapshot
Runtime Analysis of Evolutionary Diversity Optimization on a Tri-Objective Version of the (LeadingOnes, TrailingZeros) Problem
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103644openalex-snapshot
Diversity of solutions: An exploration through the lens of fixed-parameter tractability theory
inferred← citeshttps://doi.org/10.1016/j.dam.2022.07.007openalex-snapshot
Finding all minimum cost flows and a faster algorithm for the K best flow problem
inferred← citeshttps://doi.org/10.1109/icde.1999.754938openalex-snapshot
Algorithms for index-assisted selectivity estimation
inferred← citeshttps://doi.org/10.1145/3638529.3654082openalex-snapshot
A Detailed Experimental Analysis of Evolutionary Diversity Optimization for OneMinMax
inferred← citeshttps://doi.org/10.17169/refubium-26263openalex-snapshot
FPT Algorithms for Diverse Collections of Hitting Sets
inferred← citeshttps://doi.org/10.24963/ijcai.2020/156openalex-snapshot
Diversity of Solutions: An Exploration Through the Lens of Fixed-Parameter Tractability Theory
inferred← citeshttps://doi.org/10.24963/ijcai.2021/2openalex-snapshot
Diversity in Kemeny Rank Aggregation: A Parameterized Approach
inferred← citeshttps://doi.org/10.3390/a12120254openalex-snapshot
FPT Algorithms for Diverse Collections of Hitting Sets
inferred← citeshttps://doi.org/10.3390/a18030140openalex-snapshot
Finding Multiple Optimal Solutions to an Integer Linear Program by Random Perturbations of Its Objective Function
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.