On the public citation graph

Symmetry and Search in a Network Design Problem

https://doi.org/10.1007/11493853_25
0 signed · 22 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-540-45193-8_43openalex-snapshot
Using Constraint Programming to Solve the Maximum Clique Problem
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.1023/a:1009894810205openalex-snapshot
Increasing Constraint Propagation by Redundant Modeling: an Experience Report
inferredcites →https://doi.org/10.1287/ijoc.12.4.284.11884openalex-snapshot
Enhanced Model Representations for an Intra-Ring Synchronous Optical Network Design Problem Allowing Demand Splitting
inferredcites →https://doi.org/10.1287/mnsc.47.10.1396.10265openalex-snapshot
Improving Discrete Model Representations via Symmetry Considerations

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11527862_6openalex-snapshot
Transforming and Refining Abstract Constraint Specifications
inferred← citeshttps://doi.org/10.1007/11889205_4openalex-snapshot
Constraint Based Resilience Analysis
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_43openalex-snapshot
Automatically Improving Constraint Models in Savile Row through Associative-Commutative Common Subexpression Elimination
inferred← citeshttps://doi.org/10.1007/978-3-319-23219-5_23openalex-snapshot
Automatically Improving SAT Encoding of Constraint Problems Through Common Subexpression Elimination in Savile Row
inferred← citeshttps://doi.org/10.1007/978-3-642-04244-7_11openalex-snapshot
A Hybrid Constraint Model for the Routing and Wavelength Assignment Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_20openalex-snapshot
On the Design of the Next Generation Access Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-13520-0_37openalex-snapshot
Boosting Set Constraint Propagation for Network Design
inferred← citeshttps://doi.org/10.1007/978-3-642-19486-3_4openalex-snapshot
Solving the Static Design Routing and Wavelength Assignment Problem
inferred← citeshttps://doi.org/10.1007/s10601-009-9071-6openalex-snapshot
Constraint models for graceful graphs
inferred← citeshttps://doi.org/10.1007/s10732-007-9028-0openalex-snapshot
Enhancing set constraint solvers with lexicographic bounds
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.001openalex-snapshot
Automatically improving constraint models in Savile Row
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104277openalex-snapshot
Athanor: Local search over abstract constraint specifications
inferred← citeshttps://doi.org/10.1016/j.disopt.2009.05.004openalex-snapshot
Cutting plane algorithms for solving a stochastic edge-partition problem
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80021-0openalex-snapshot
Constraints over Structured Domains
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)80029-5openalex-snapshot
Constraint Applications in Networks
inferred← citeshttps://doi.org/10.1016/s1574-6526(06)x8001-xopenalex-snapshot
Handbook of Constraint Programming
inferred← citeshttps://doi.org/10.29007/7thsopenalex-snapshot
Constraint Problem Specification as Compression
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.