On the public citation graph
Mathematical models and empirical analysis of a simulated annealing approach for two variants of the static data segment allocation problem
0 signed · 51 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/978-3-540-75514-2_12openalex-snapshot
A Hybrid VNS for Connected Facility Location
inferredcites →https://doi.org/10.1007/bf02023004openalex-snapshot
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem
inferredcites →https://doi.org/10.1007/bf02109861openalex-snapshot
Strong formulations and cutting planes for designing digital data service networks
inferredcites →https://doi.org/10.1007/bf02601642openalex-snapshot
A comparison of two methods for solving 0–1 integer programs using a general purpose simulated annealing algorithm
inferredcites →https://doi.org/10.1007/s00453-004-1112-3openalex-snapshot
Primal–Dual Algorithms for Connected Facility Location Problems
inferredcites →https://doi.org/10.1007/s10479-015-1840-6openalex-snapshot
Facility location models to locate data in information networks: a literature review
inferredcites →https://doi.org/10.1016/0377-2217(94)90318-2openalex-snapshot
Integer programming formulations of discrete hub location problems
inferredcites →https://doi.org/10.1016/j.comcom.2011.10.005openalex-snapshot
A survey on content-centric technologies for the current Internet: CDN and P2P solutions
inferredcites →https://doi.org/10.1016/j.cor.2010.07.002openalex-snapshot
MIP models for connected facility location: A theoretical and computational study
inferredcites →https://doi.org/10.1016/j.cor.2014.05.023openalex-snapshot
Exact approaches for static data segment allocation problem in an information network
inferredcites →https://doi.org/10.1016/j.ejor.2009.05.044openalex-snapshot
The Tree of Hubs Location Problem
inferredcites →https://doi.org/10.1016/j.ejor.2012.10.051openalex-snapshot
An improved Benders decomposition algorithm for the tree of hubs location problem
inferredcites →https://doi.org/10.1016/j.endm.2013.05.079openalex-snapshot
A Flow Formulation for the Optimum Communication Spanning Tree
inferredcites →https://doi.org/10.1016/j.swevo.2011.10.003openalex-snapshot
Using penalties instead of rewards: Solving OCST problems with guided local search
inferredcites →https://doi.org/10.1016/j.tre.2006.01.005openalex-snapshot
Hub location under capacity constraints
inferredcites →https://doi.org/10.1016/s0966-8349(96)00011-3openalex-snapshot
Efficient algorithms for the uncapacitated single allocation p-hub median problem
inferredcites →https://doi.org/10.1023/a:1011211220465openalex-snapshot
A General Meta-Heuristic Based Solver for Combinatorial Optimisation Problems
inferredcites →https://doi.org/10.1023/a:1018915104438openalex-snapshot
A simulated annealing code for general integer linear programs
inferredcites →https://doi.org/10.1023/a:1018994432663openalex-snapshot
Solution algorithms for the capacitated single allocation hub location problem
inferredcites →https://doi.org/10.1057/palgrave.jors.2602490openalex-snapshot
A two-level simulated annealing algorithm for efficient dissemination of electronic content
inferredcites →https://doi.org/10.1063/1.34823openalex-snapshot
Concepts of scale in simulated annealing
inferredcites →https://doi.org/10.1093/ietfec/e89-a.10.2882openalex-snapshot
A New Evolutionary Approach for the Optimal Communication Spanning Tree Problem
inferredcites →https://doi.org/10.1108/09600030110389532openalex-snapshot
Using simulated annealing to solve the p‐Hub Median Problem
inferredcites →https://doi.org/10.1109/mnet.2007.334311openalex-snapshot
Video-on-Demand Networks: Design Approaches and Future Challenges
inferredcites →https://doi.org/10.1109/saint.2008.64openalex-snapshot
A GRASP Algorithm for the Connected Facility Location Problem
inferredcites →https://doi.org/10.1109/sfcs.2000.892329openalex-snapshot
Building Steiner trees with incomplete global knowledge
inferredcites →https://doi.org/10.1109/tc.1986.1676799openalex-snapshot
Computer and Database Location in Distributed Computer Systems
inferredcites →https://doi.org/10.1109/tevc.2010.2093580openalex-snapshot
Edge Orientation and the Design of Problem-Specific Crossover Operators for the OCST Problem
inferredcites →https://doi.org/10.1109/tsmca.2009.2030165openalex-snapshot
Optimal Content Distribution in Video-on-Demand Tree Networks
inferredcites →https://doi.org/10.1126/science.220.4598.671openalex-snapshot
Optimization by Simulated Annealing
inferredcites →https://doi.org/10.1145/1921168.1921174openalex-snapshot
Optimal content placement for a large-scale VoD system
inferredcites →https://doi.org/10.1287/ijoc.1090.0375openalex-snapshot
Dual-Based Local Search for the Connected Facility Location and Related Problems
inferredcites →https://doi.org/10.1287/trsc.21.3.163openalex-snapshot
Exact and Heuristic Algorithms for the Optimum Communication Spanning Tree Problem
inferredcites →https://doi.org/10.14279/depositonce-14391openalex-snapshot
Approximating Connected Facility Location Problems via Random Facility Sampling and Core Detouring
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-319-07153-4_4-2openalex-snapshot
A History of Metaheuristics
inferred← citeshttps://doi.org/10.1007/978-3-319-42902-1_15openalex-snapshot
A Benders Decomposition Approach for Static Data Segment Location to Servers Connected by a Tree Backbone
inferred← citeshttps://doi.org/10.1007/s00500-023-08452-xopenalex-snapshot
A new approach based on greedy minimizing algorithm for solving data allocation problem
inferred← citeshttps://doi.org/10.1007/s10479-015-1840-6openalex-snapshot
Facility location models to locate data in information networks: a literature review
inferred← citeshttps://doi.org/10.1007/s10489-017-0995-zopenalex-snapshot
Discrete particle swarm optimization algorithms for two variants of the static data segment location problem
inferred← citeshttps://doi.org/10.1007/s10489-019-01609-yopenalex-snapshot
Multiple allocation p-hub location problem for content placement in VoD services: a differential evolution based approach
inferred← citeshttps://doi.org/10.1007/s12065-020-00437-1openalex-snapshot
The hub location’s method for solving optimal control problems
inferred← citeshttps://doi.org/10.1007/s42452-019-1787-3openalex-snapshot
Data allocation in distributed database systems: a novel hybrid method based on differential evolution and variable neighborhood search
inferred← citeshttps://doi.org/10.1016/j.asoc.2017.11.019openalex-snapshot
A new approach based on particle swarm optimization algorithm for solving data allocation problem
inferred← citeshttps://doi.org/10.1016/j.cie.2021.107432openalex-snapshot
A new variant of the p-hub location problem with a ring backbone network for content placement in VoD services
inferred← citeshttps://doi.org/10.1016/j.cor.2018.08.012openalex-snapshot
An intermodal hub location problem for container distribution in Indonesia
inferred← citeshttps://doi.org/10.1016/j.cor.2018.09.006openalex-snapshot
The 2-allocation p-hub median problem and a modified Benders decomposition method for solving hub location problems
inferred← citeshttps://doi.org/10.1109/ieem45057.2020.9309871openalex-snapshot
User Aggregation Models for a Video-on-Demand (VoD) System
inferred← citeshttps://doi.org/10.1111/itor.70217openalex-snapshot
An enhanced adaptive large neighborhood search algorithm for the multiple allocation p ‐hub location problem with a mesh backbone network in video‐on‐demand services
inferred← citeshttps://doi.org/10.22305/ict-unpa.v8i3.222openalex-snapshot
Algoritmos metaheurísticos trayectoriales para optimizar problemas combinatorios
inferred← citeshttps://doi.org/10.3390/designs3030037openalex-snapshot
An Overview of AI Methods for in-Core Fuel Management: Tools for the Automatic Design of Nuclear Reactor Core Configurations for Fuel Reload, (Re)arranging New and Partly Spent Fuel
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.