On the public citation graph

Facility locations revisited: An efficient belief propagation approach

https://doi.org/10.1109/ical.2010.5585318
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.1002/9781118032343openalex-snapshot
Network and Discrete Location
inferredcites →https://doi.org/10.1016/0378-3758(89)90033-5openalex-snapshot
Algorithms for clustering data
inferredcites →https://doi.org/10.1016/j.cor.2005.07.014openalex-snapshot
Solving the uncapacitated facility location problem using tabu search
inferredcites →https://doi.org/10.1016/s0966-8349(98)00030-8openalex-snapshot
Variable neighborhood search for the p-median
inferredcites →https://doi.org/10.1109/18.825794openalex-snapshot
The generalized distributive law
inferredcites →https://doi.org/10.1109/18.910572openalex-snapshot
Factor graphs and the sum-product algorithm
inferredcites →https://doi.org/10.1109/tit.2005.850085openalex-snapshot
Constructing Free-Energy Approximations and Generalized Belief Propagation Algorithms
inferredcites →https://doi.org/10.1126/science.1086309openalex-snapshot
Passing Messages Between Disciplines
inferredcites →https://doi.org/10.1126/science.1136800openalex-snapshot
Clustering by Passing Messages Between Data Points
inferredcites →https://doi.org/10.1287/mnsc.29.4.482openalex-snapshot
State of the Art—Location on Networks: A Survey. Part I: The p-Center and p-Median Problems
inferredcites →https://doi.org/10.1287/opre.16.5.955openalex-snapshot
Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph
inferredcites →https://doi.org/10.1287/opre.21.2.498openalex-snapshot
An Effective Heuristic Algorithm for the Traveling-Salesman Problem
inferredcites →https://doi.org/10.2307/1268876openalex-snapshot
Algorithms for Clustering Data
inferredcites →https://doi.org/10.48550/arxiv.1301.2317openalex-snapshot
Belief Optimization for Binary Networks: A Stable Alternative to Loopy Belief Propagation

What points at this work

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

inferred← citeshttps://doi.org/10.2139/ssrn.5030361openalex-extracted
Decentralized Message Passing Algorithm for Heterogeneous Multi-Depot Vehicle Routing Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-12637-1_40openalex-snapshot
A Unified Framework for Privacy Preserving Data Clustering
inferred← citeshttps://doi.org/10.1007/978-3-319-12640-1_39openalex-snapshot
Privacy Preserving Clustering: A k-Means Type Extension
inferred← citeshttps://doi.org/10.1007/978-3-642-34500-5_52openalex-snapshot
Clustering with Uncertainties: An Affinity Propagation-Based Approach
inferred← citeshttps://doi.org/10.1016/j.orp.2025.100341openalex-snapshot
Decentralized message passing algorithm for heterogeneous multi-depot vehicle routing problems
inferred← citeshttps://doi.org/10.1080/00207721.2025.2602076openalex-snapshot
Approximate message passing algorithm for decentralised task assignment and scheduling
inferred← citeshttps://doi.org/10.1109/ical.2011.6024687openalex-snapshot
Wireless sensor network cluster locations: A probabilistic inference approach
inferred← citeshttps://doi.org/10.1109/icinfa.2012.6246890openalex-snapshot
Probabilistic inference over sensor networks for clusters: Extension to multiple states
inferred← citeshttps://doi.org/10.1109/icinfa.2013.6720444openalex-snapshot
A parallel Probabilistic Latent Semantic Analysis method on MapReduce platform
inferred← citeshttps://doi.org/10.1109/icinfa.2014.6932819openalex-snapshot
Modularity-based community detection in large networks: An empirical evaluation
inferred← citeshttps://doi.org/10.1109/indicon.2014.7030648openalex-snapshot
A density based model for facility location problem
inferred← citeshttps://doi.org/10.1109/iscmi.2015.18openalex-snapshot
An Empirical Study of Spectral Social Network Partition on GPGPU Platforms
inferred← citeshttps://doi.org/10.18178/ijmlc.2020.10.1.921openalex-snapshot
Logistic Profile Generation via Clustering Analy
inferred← citeshttps://doi.org/10.2514/6.2015-0358openalex-snapshot
Decentralized Message Passing for Minimum Sensor Cover Based on Belief Propagation
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.