On the public citation graph
Conditional Symmetry Breaking
0 signed · 37 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45578-7openalex-snapshot
Principles and practice of constraint programming - CP 2001 : 7th International Conference, CP 2001, Paphos, Cyprus, November 26-December 1, 2001 : proceedings
inferredcites →https://doi.org/10.1007/3-540-46135-3openalex-snapshot
Principles and Practice of Constraint Programming - CP 2002
inferredcites →https://doi.org/10.1007/3-540-46135-3_28openalex-snapshot
Groups and Constraints: Symmetry Breaking during Search
inferredcites →https://doi.org/10.1007/3-540-46135-3_7openalex-snapshot
Global Constraints for Lexicographic Orderings
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_23openalex-snapshot
Generic SBDD Using Computational Group Theory
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
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/9780470612309.ch10openalex-snapshot
Symmetry Breaking in Subgraph Pattern Matching
inferred← citeshttps://doi.org/10.1007/11564751_47openalex-snapshot
Caching Search States in Permutation Problems
inferred← citeshttps://doi.org/10.1007/11889205_46openalex-snapshot
General Symmetry Breaking Constraints
inferred← citeshttps://doi.org/10.1007/978-3-032-39395-1_28openalex-snapshot
Symmetry Reduction for Nash Equilibrium Synthesis in Region-Control Multi-agent Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-68279-0_17openalex-snapshot
Symmetry in Integer Linear Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_16openalex-snapshot
Local Symmetry Breaking During Search in CSPs
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_60openalex-snapshot
Groupoids and Conditional Symmetry
inferred← citeshttps://doi.org/10.1007/978-3-540-74970-7_66openalex-snapshot
Constraint Symmetry for the Soft CSP
inferred← citeshttps://doi.org/10.1007/978-3-540-89439-1_1openalex-snapshot
Symmetry Breaking for Maximum Satisfiability
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-33558-7_4openalex-snapshot
A Generic Method for Identifying and Exploiting Dominance Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-40627-0_41openalex-snapshot
Breaking Symmetry with Different Orderings
inferred← citeshttps://doi.org/10.1007/s10107-019-01457-1openalex-snapshot
Orbitopal fixing for the full (sub-)orbitope and application to the Unit Commitment Problem
inferred← citeshttps://doi.org/10.1007/s10472-010-9173-2openalex-snapshot
Dynamic symmetry-breaking for Boolean satisfiability
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-9163-9openalex-snapshot
Symmetries, almost symmetries, and lazy clause generation
inferred← citeshttps://doi.org/10.1007/s10601-014-9173-7openalex-snapshot
Dominance breaking constraints
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80014-3openalex-snapshot
Symmetry in Constraint Programming
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.1145/2676585.2676605openalex-snapshot
Solving the all-interval series problem
inferred← citeshttps://doi.org/10.1145/3623278.3624752openalex-snapshot
MiniMalloc: A Lightweight Memory Allocator for Hardware-Accelerated Machine Learning
inferred← citeshttps://doi.org/10.1287/ijoc.1080.0283openalex-snapshot
Solving Lot-Sizing Problems on Parallel Identical Machines Using Symmetry-Breaking Constraints
inferred← citeshttps://doi.org/10.25560/67897openalex-snapshot
Symmetry and degeneracy in nonconvex optimisation problems: Application to heat recovery networks
inferred← citeshttps://doi.org/10.26180/4546099openalex-snapshot
Automatic symmetry detection and dynamic symmetry breaking for constraint programming
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-3openalex-snapshot
Breaking Conditional Symmetry in Automated Constraint Modelling with CONJURE
inferred← citeshttps://doi.org/10.3390/sym13010013openalex-snapshot
Breakout Group Allocation Schedules and the Social Golfer Problem with Adjacent Group Sizes
inferred← citeshttps://doi.org/10.48550/arxiv.1606.09594openalex-snapshot
Contextual Symmetries in Probabilistic Graphical Models
inferred← citeshttps://doi.org/10.48550/arxiv.1712.05222openalex-snapshot
Symmetry Detection for Quadratically Constrained Quadratic Programs Using Binary Layered Graphs
inferred← citeshttps://doi.org/10.5555/1365527.1365533openalex-snapshot
Search in the patience game ‘Black Hole’
inferred← citeshttps://doi.org/10.70675/4af5a523z30b9z4cc8z8a91zeb0138244181openalex-snapshot
Combinatorial aspects of the Unit Commitment 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.