On the public citation graph
Survivable IP network design with OSPF routing
0 signed · 40 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.1002/net.10102openalex-snapshot
Optimization of Internet Protocol network design and routing
inferredcites →https://doi.org/10.1002/net.20070openalex-snapshot
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
inferredcites →https://doi.org/10.1007/bf01386390openalex-snapshot
A note on two problems in connexion with graphs
inferredcites →https://doi.org/10.1023/a:1014852026591openalex-snapshot
A Genetic Algorithm for the Weight Setting Problem in OSPF Routing
inferredcites →https://doi.org/10.1023/b:coap.0000039487.35027.02openalex-snapshot
Increasing Internet Capacity Using Local Search
inferredcites →https://doi.org/10.1287/ijoc.6.2.154openalex-snapshot
Genetic Algorithms and Random Keys for Sequencing and Optimization
inferredcites →https://doi.org/10.5860/choice.27-0936openalex-snapshot
Genetic algorithms in search, optimization, and machine learning
inferredcites →https://doi.org/10.7551/mitpress/1090.001.0001openalex-snapshot
Adaptation in Natural and Artificial Systems
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-07124-4_30openalex-snapshot
Random-Key Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/978-3-319-07153-4_30-1openalex-snapshot
Random-Key Genetic Algorithms
inferred← citeshttps://doi.org/10.1007/s00500-024-09948-wopenalex-snapshot
A biased random-key genetic algorithm for the knapsack problem with forfeit sets
inferred← citeshttps://doi.org/10.1007/s10479-013-1317-4openalex-snapshot
Mathematical programming approaches for dual multicast routing problem with multilayer risk cost
inferred← citeshttps://doi.org/10.1007/s10732-009-9115-5openalex-snapshot
Two-level evolutionary approach to the survivable mesh-based transport network topological design
inferred← citeshttps://doi.org/10.1007/s10732-010-9143-1openalex-snapshot
Biased random-key genetic algorithms for combinatorial optimization
inferred← citeshttps://doi.org/10.1007/s10878-009-9282-1openalex-snapshot
A parallel multi-population genetic algorithm for a constrained two-dimensional orthogonal packing problem
inferred← citeshttps://doi.org/10.1007/s10898-010-9608-7openalex-snapshot
A biased random-key genetic algorithm for routing and wavelength assignment
inferred← citeshttps://doi.org/10.1007/s10898-015-0389-xopenalex-snapshot
A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
inferred← citeshttps://doi.org/10.1007/s10922-009-9155-zopenalex-snapshot
Designing Connection Oriented Networks for Multi-Domain Path Resilience
inferred← citeshttps://doi.org/10.1007/s11750-011-0176-xopenalex-snapshot
Biased random-key genetic algorithms with applications in telecommunications
inferred← citeshttps://doi.org/10.1016/j.cor.2009.12.009openalex-snapshot
Redundant multicast routing in multilayer networks with shared risk resource groups: Complexity, models and algorithms
inferred← citeshttps://doi.org/10.1016/j.cor.2011.02.019openalex-snapshot
Linear programming models for traffic engineering in 100% survivable networks under combined IS–IS/OSPF and MPLS-TE
inferred← citeshttps://doi.org/10.1016/j.cor.2011.03.009openalex-snapshot
A parallel multi-population biased random-key genetic algorithm for a container loading problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.030openalex-snapshot
Biased random-key genetic algorithms: A review
inferred← citeshttps://doi.org/10.1109/cec.2011.5949896openalex-snapshot
Biased random-key genetic algorithm for fiber installation in Optical Network Optimization
inferred← citeshttps://doi.org/10.1109/cec.2018.8477947openalex-snapshot
A Biased Random Key Genetic Algorithm to Solve the Transmission Expansion Planning Problem with Re-design
inferred← citeshttps://doi.org/10.1109/drcn.2009.5340014openalex-snapshot
Survivable IP link topology design in an IP-over-WDM architecture
inferred← citeshttps://doi.org/10.1109/icn.2007.74openalex-snapshot
Planning of IP Networks with Quality of Service Guarantee
inferred← citeshttps://doi.org/10.1109/ieem.2015.7385771openalex-snapshot
Survey on applications of biased-random key genetic algorithms for solving optimization problems
inferred← citeshttps://doi.org/10.1109/ondm.2016.7494054openalex-snapshot
Joint fault tolerant and latency-aware design of multilayer optical networks
inferred← citeshttps://doi.org/10.1109/saint.2012.28openalex-snapshot
Accelerating Flow-Level Network Simulation with Low-Pass Filtering of Fluid Models
inferred← citeshttps://doi.org/10.1111/itor.12429openalex-snapshot
A biased random‐key genetic algorithm for scheduling heterogeneous multi‐round systems
inferred← citeshttps://doi.org/10.1287/opre.2019.1956openalex-snapshot
Near-Optimal Disjoint-Path Facility Location Through Set Cover by Pairs
inferred← citeshttps://doi.org/10.1364/jocn.3.000017openalex-snapshot
Genetic Algorithm for the Topological Design of Survivable Optical Transport Networks
inferred← citeshttps://doi.org/10.1364/jocn.9.000b53openalex-snapshot
Guaranteeing Traffic Survivability and Latency Awareness in Multilayer Network Design
inferred← citeshttps://doi.org/10.4018/978-1-4666-3652-1.ch007openalex-snapshot
Topological Design Using Genetic Algorithms
inferred← citeshttps://doi.org/10.4018/jitn.2013010103openalex-snapshot
Designing an IP Link Topology for a Metro Area Backbone Network
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.