On the public citation graph

Iterated local search algorithms for the Euclidean Steiner tree problem in n dimensions

0 signed · 27 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/j.1538-7305.1957.tb01515.xopenalex-snapshot
Shortest Connection Networks And Some Generalizations
inferredcites →https://doi.org/10.1002/net.3230240303openalex-snapshot
Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R d
inferredcites →https://doi.org/10.1002/net.3230240802openalex-snapshot
Experimental evaluation of a partitioning algorithm for the steiner tree problem in R 2 and R 3
inferredcites →https://doi.org/10.1002/net.3230260411openalex-snapshot
An O(N2) heuristic for steiner minimal trees in E3
inferredcites →https://doi.org/10.1007/978-1-4419-1665-5_12openalex-snapshot
Iterated Local Search: Framework and Applications
inferredcites →https://doi.org/10.1007/978-1-4615-1507-4openalex-snapshot
Essays and Surveys in Metaheuristics
inferredcites →https://doi.org/10.1007/bf01758756openalex-snapshot
How to find Steiner minimal trees in euclideand-space
inferredcites →https://doi.org/10.1016/j.disopt.2007.08.006openalex-snapshot
An improved algorithm for computing Steiner minimal trees in Euclidean d -space
inferredcites →https://doi.org/10.1023/a:1018903619285openalex-snapshot
The Euclidean Steiner tree problem in Rn: A mathematical programming formulation
inferredcites →https://doi.org/10.1023/b:numa.0000021765.17831.bcopenalex-snapshot
Using a Conic Formulation for Finding Steiner Minimal Trees
inferredcites →https://doi.org/10.1093/biomet/72.1.191openalex-snapshot
Applications of the Annealing Algorithm to Combinatorial Problems in Statistics
inferredcites →https://doi.org/10.1103/physreve.68.056702openalex-snapshot
Microcanonical optimization algorithm for the Euclidean Steiner problem in Rn with application to phylogenetic inference
inferredcites →https://doi.org/10.1111/j.1469-1809.1973.tb00595.xopenalex-snapshot
The method of minimum evolution
inferredcites →https://doi.org/10.1137/0116001openalex-snapshot
Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/0132072openalex-snapshot
The Complexity of Computing Steiner Minimal Trees
inferredcites →https://doi.org/10.1137/s1052623494275069openalex-snapshot
A Dynamic Adaptive Relaxation Scheme Applied to the Euclidean Steiner Minimal Tree Problem
inferredcites →https://doi.org/10.1137/s1052623495288362openalex-snapshot
An Efficient Algorithm for Minimizing a Sum of Euclidean Norms with Applications
inferredcites →https://doi.org/10.2307/2306136openalex-snapshot
Double Factorials
inferredcites →https://doi.org/10.6083/nk322d67mopenalex-snapshot
Large-step Markov chains for the Traveling Salesman Problem

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.4850484openalex-extracted
A Quantitative Evaluation of Statistical Practices in Metaheuristics Research
inferred← citeshttps://doi.org/10.1007/978-3-319-38851-9_15openalex-snapshot
Steiner Tree Heuristic in the Euclidean d-Space Using Bottleneck Distances
inferred← citeshttps://doi.org/10.1007/978-3-319-91086-4_5openalex-snapshot
Iterated Local Search: Framework and Applications
inferred← citeshttps://doi.org/10.1007/s11750-022-00642-4openalex-snapshot
A new heuristic for the Euclidean Steiner Tree Problem in $${\mathbb {R}}^n$$
inferred← citeshttps://doi.org/10.1090/mcom/3442openalex-snapshot
Numerical approximation of the Steiner problem in dimension 2 and 3
inferred← citeshttps://doi.org/10.1111/itor.13265openalex-snapshot
A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
inferred← citeshttps://doi.org/10.26636/jtit.2017.122017openalex-snapshot
Monte Carlo Tree Search Algorithm for the Euclidean Steiner Tree Problem
inferred← citeshttps://doi.org/10.70675/a790e55aza24dz496fzbc91zcfdd21f4041bopenalex-snapshot
Approximations par champs de phases pour des problemes de transport branche
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.