On the public citation graph
A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
0 signed · 155 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/bltj.2267openalex-snapshot
Optimal routing in shortest-path data networks
inferredcites →https://doi.org/10.1006/jagm.1996.0046openalex-snapshot
An Incremental Algorithm for a Generalization of the Shortest-Path Problem
inferredcites →https://doi.org/10.1007/0-306-48056-5_8openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1007/bf01096763openalex-snapshot
Greedy Randomized Adaptive Search Procedures
inferredcites →https://doi.org/10.1016/s0166-5316(02)00036-6openalex-snapshot
On open shortest path first related network optimisation problems
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/a:1015061802659openalex-snapshot
Probability Distribution of Solution Time in GRASP: An Experimental Investigation
inferredcites →https://doi.org/10.1023/b:coap.0000039487.35027.02openalex-snapshot
Increasing Internet Capacity Using Local Search
inferredcites →https://doi.org/10.1090/dimacs/053/01openalex-snapshot
Design of broadband virtual private networks: Model and heuristics for the B-WiN
inferredcites →https://doi.org/10.1109/90.929850openalex-snapshot
Deriving traffic demands for operational IP networks: methodology and experience
inferredcites →https://doi.org/10.1109/icc.1993.397358openalex-snapshot
Minimax open shortest path first routing algorithms in networks supporting the SMDS service
inferredcites →https://doi.org/10.1109/infcom.1996.493353openalex-snapshot
How to model an internetwork
inferredcites →https://doi.org/10.1109/infcom.2002.1019307openalex-snapshot
Characterizing the Internet hierarchy from multiple vantage points
inferredcites →https://doi.org/10.1109/mcom.2002.1039866openalex-snapshot
Traffic engineering with traditional IP routing protocols
inferredcites →https://doi.org/10.1109/tnet.2003.822655openalex-snapshot
Measuring ISP Topologies With Rocketfuel
inferredcites →https://doi.org/10.1145/297096.297147openalex-snapshot
Experimental analysis of dynamic algorithms for the single source shortest paths problem
inferredcites →https://doi.org/10.1287/ijoc.6.2.154openalex-snapshot
Genetic Algorithms and Random Keys for Sequencing and Optimization
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/nem.2321openalex-snapshot
Multitopology Routing With Virtual Topologies and Segment Routing
inferred← citeshttps://doi.org/10.1002/net.20141openalex-snapshot
Survivable IP network design with OSPF routing
inferred← citeshttps://doi.org/10.1002/net.20163openalex-snapshot
Inapproximability results for the inverse shortest paths problem with integer lengths and unique shortest paths
inferred← citeshttps://doi.org/10.1002/net.20303openalex-snapshot
Approximability of unsplittable shortest path routing problems
inferred← citeshttps://doi.org/10.1002/net.21450openalex-snapshot
Real‐time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components
inferred← citeshttps://doi.org/10.1007/11753810_21openalex-snapshot
An Approach to Off-Line Inter-domain QoS-Aware Resource Optimization
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_17openalex-snapshot
Optimization Issues in Quality of Service
inferred← citeshttps://doi.org/10.1007/978-0-387-30165-5_4openalex-snapshot
Metaheuristics and Applications to Optimization Problems in Telecommunications
inferred← citeshttps://doi.org/10.1007/978-1-4419-7997-1_63openalex-snapshot
Combinatorial Optimization in Transportation and Logistics Networks
inferred← citeshttps://doi.org/10.1007/978-3-030-86514-6_30openalex-snapshot
Monte Carlo Search Algorithms for Network Traffic Engineering
inferred← citeshttps://doi.org/10.1007/978-3-031-37283-4_3openalex-snapshot
Metaheuristics and Local Search
inferred← citeshttps://doi.org/10.1007/978-3-032-00385-0_62openalex-snapshot
Metaheuristics for Problems in Sports Scheduling
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/978-3-319-07153-4_62-1openalex-snapshot
Metaheuristics for Problems in Sports Scheduling
inferred← citeshttps://doi.org/10.1007/978-3-540-30176-9_27openalex-snapshot
Applications and Parallel Implementations of Metaheuristics in Network Design and Routing
inferred← citeshttps://doi.org/10.1007/978-3-540-30193-6_15openalex-snapshot
A Fast Heuristic for Genetic Algorithms in Link Weight Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-71805-5_8openalex-snapshot
Evolutionary Computation for Quality of Service Internet Routing Optimization
inferred← citeshttps://doi.org/10.1007/978-3-540-72845-0_30openalex-snapshot
Experimental Analysis of Algorithms for Updating Minimum Spanning Trees on Graphs Subject to Changes on Edge Weights
inferred← citeshttps://doi.org/10.1007/978-3-540-75514-2_7openalex-snapshot
A Hybrid ILS Heuristic to the Referee Assignment Problem with an Embedded MIP Strategy
inferred← citeshttps://doi.org/10.1007/978-3-540-77903-2_2openalex-snapshot
Routing and Capacity Optimization for IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-540-79409-7_7openalex-snapshot
Integer Programming Approaches to Access and Backbone IP Network Planning
inferred← citeshttps://doi.org/10.1007/978-3-540-87744-8_17openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferred← citeshttps://doi.org/10.1007/978-3-642-02250-0_8openalex-snapshot
Optimization of OSPF Routing in IP Networks
inferred← citeshttps://doi.org/10.1007/978-981-13-1822-1_19openalex-snapshot
Impact of Mathematical Optimization on OSPF Routing in WDM Optical Networks
inferred← citeshttps://doi.org/10.1007/s00453-009-9381-5openalex-snapshot
An Integer Programming Algorithm for Routing Optimization in IP Networks
inferred← citeshttps://doi.org/10.1007/s10288-009-0113-0openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
inferred← citeshttps://doi.org/10.1007/s10479-006-0067-yopenalex-snapshot
Multiobjective design of survivable IP networks
inferred← citeshttps://doi.org/10.1007/s10479-012-1270-7openalex-snapshot
Intra-domain traffic engineering with shortest path routing protocols
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/s10479-015-1800-1openalex-snapshot
On the minimization of traffic congestion in road networks with tolls
inferred← citeshttps://doi.org/10.1007/s10732-010-9142-2openalex-snapshot
A biased random-key genetic algorithm with forward-backward improvement for the resource constrained project scheduling problem
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/s10732-025-09568-zopenalex-snapshot
A Random-Key optimizer 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/s10898-024-01446-5openalex-snapshot
Early years of biased random-key genetic algorithms: a systematic review
inferred← citeshttps://doi.org/10.1007/s10922-021-09627-3openalex-snapshot
Centrality Based Congestion Detection Using Reinforcement Learning Approach for Traffic Engineering in Hybrid SDN
inferred← citeshttps://doi.org/10.1007/s11235-010-9298-yopenalex-snapshot
GATEway: symbiotic inter-domain traffic engineering
inferred← citeshttps://doi.org/10.1007/s11235-021-00797-8openalex-snapshot
A survey on QoS routing protocols in Vehicular Ad Hoc Network (VANET)
inferred← citeshttps://doi.org/10.1007/s11590-006-0031-4openalex-snapshot
TTT plots: a perl program to create time-to-target plots
inferred← citeshttps://doi.org/10.1007/s11590-010-0226-6openalex-snapshot
A biased random-key genetic algorithm for road congestion minimization
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/b978-0-12-801538-4.00002-1openalex-snapshot
Bio-Inspired Approaches in Telecommunications
inferred← citeshttps://doi.org/10.1016/b978-0-443-28993-4.00079-2openalex-snapshot
Metaheuristics for operations and supply chain management: Fundamentals and applications
inferred← citeshttps://doi.org/10.1016/j.asoc.2009.11.026openalex-snapshot
Quality of Service constrained routing optimization using Evolutionary Computation
inferred← citeshttps://doi.org/10.1016/j.cie.2020.106651openalex-snapshot
Dynamic relative robust shortest path problem
inferred← citeshttps://doi.org/10.1016/j.cie.2023.109110openalex-snapshot
Problem characterization of unique shortest path routing
inferred← citeshttps://doi.org/10.1016/j.comcom.2006.08.027openalex-snapshot
Metaheuristics for optimization problems in computer communications
inferred← citeshttps://doi.org/10.1016/j.comcom.2007.01.003openalex-snapshot
Improved balancing heuristics for optimizing shortest path routing
inferred← citeshttps://doi.org/10.1016/j.cor.2007.07.001openalex-snapshot
A random key based genetic algorithm for the resource constrained project scheduling problem
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.03.009openalex-snapshot
A parallel multi-population biased random-key genetic algorithm for a container loading problem
inferred← citeshttps://doi.org/10.1016/j.cor.2014.11.011openalex-snapshot
A biased random-key genetic algorithm for the capacitated minimum spanning tree problem
inferred← citeshttps://doi.org/10.1016/j.cor.2017.09.021openalex-snapshot
Optimal configuration of power distribution networks with variable renewable energy resources
inferred← citeshttps://doi.org/10.1016/j.cosrev.2009.07.001openalex-snapshot
A survey of repair methods used as constraint handling techniques in evolutionary algorithms
inferred← citeshttps://doi.org/10.1016/j.ejor.2006.06.074openalex-snapshot
A genetic algorithm for the resource constrained multi-project scheduling problem
inferred← citeshttps://doi.org/10.1016/j.ejor.2020.08.018openalex-snapshot
Heuristics for the dynamic facility location problem with modular capacities
inferred← citeshttps://doi.org/10.1016/j.ejor.2024.03.030openalex-snapshot
Biased random-key genetic algorithms: A review
inferred← citeshttps://doi.org/10.1016/j.ifacol.2016.07.654openalex-snapshot
Robust Optimization for OSPF Routing**This work was partially supported by CNPq, CAPES, and FAPEMIG.
inferred← citeshttps://doi.org/10.1016/s1570-6672(13)60142-7openalex-snapshot
Transportation Routing in Urban Environments Using Updated Traffic Information Provided through Vehicular Communications
inferred← citeshttps://doi.org/10.1057/s41274-016-0144-9openalex-snapshot
An origin-based model for unique shortest path routing
inferred← citeshttps://doi.org/10.1109/aiccsa.2007.370882openalex-snapshot
A Heuristic Genetic Algorithm for the Single Source Shortest Path Problem
inferred← citeshttps://doi.org/10.1109/aict.2005.15openalex-snapshot
A two-phase algorithm for off-line inter-domain traffic optimization
inferred← citeshttps://doi.org/10.1109/apcc.2013.6766051openalex-snapshot
Enhancing Preventive Start-time Optimization considering both failure and non-failure scenarios
inferred← citeshttps://doi.org/10.1109/atnac.2008.4783288openalex-snapshot
Minimizing the Number of Congested Links in OSPF Routing
inferred← citeshttps://doi.org/10.1109/cec.2006.1688649openalex-snapshot
QoS Constrained Internet Routing with Evolutionary Algorithms
inferred← citeshttps://doi.org/10.1109/cec.2007.4424723openalex-snapshot
A multi-layered solution for supporting isp traffic demand using genetic algorithm
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.2013.6557909openalex-snapshot
Evolutionary synthesis of robust QCA circuits
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/codit58514.2023.10284215openalex-snapshot
Unsplittable Shortest Path Routing: Extended Model and Matheuristic
inferred← citeshttps://doi.org/10.1109/drcn.2014.6816138openalex-snapshot
Preventive start-time optimization against network failure
inferred← citeshttps://doi.org/10.1109/fgct.2012.6476576openalex-snapshot
A model of IP traceability Dynamic Collaboration technology in the denial of service attack
inferred← citeshttps://doi.org/10.1109/glocom.2011.6133523openalex-snapshot
Network Configuration and Management via Two-Phase Online Optimization
inferred← citeshttps://doi.org/10.1109/glocomw.2010.5700365openalex-snapshot
Probabilistic Trans-Algorithmic search for automated network management and configuration
inferred← citeshttps://doi.org/10.1109/hoticn53262.2021.9680833openalex-snapshot
An Programmable Control Plane Framework by Using Behavior Tree
inferred← citeshttps://doi.org/10.1109/hpsr.2006.1709721openalex-snapshot
RTF/spl I.bar/TIE: a tunable interdomain egress selection algorithm robust to transient link failures
inferred← citeshttps://doi.org/10.1109/icc.2011.5963219openalex-snapshot
Optimization of OSPF Link Weight to Minimize Worst-Case Network Congestion against Single-Link Failure
inferred← citeshttps://doi.org/10.1109/iccce.2008.4580628openalex-snapshot
A matrix usage of load balancing heuristic for shortest path routing
inferred← citeshttps://doi.org/10.1109/icghpc.2013.6533929openalex-snapshot
Performance analysis of OSPF and EIGRP routing protocols for greener internetworking
inferred← citeshttps://doi.org/10.1109/icisct52966.2021.9670385openalex-snapshot
An approach to finding the most optimal route in a dynamic graph
inferred← citeshttps://doi.org/10.1109/icsnc.2008.49openalex-snapshot
Implementation of Traffic Engineering in NGNs Using Hybrid Genetic Algorithms
inferred← citeshttps://doi.org/10.1109/ictmicc.2007.4448682openalex-snapshot
A review of routing optimization using OSPF
inferred← citeshttps://doi.org/10.1109/icton.2016.7550605openalex-snapshot
Reoptimizing shortest paths: From state of the art to new recent perspectives
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/infocom.2016.7524507openalex-snapshot
A novel framework for modeling and mitigating distributed link flooding attacks
inferred← citeshttps://doi.org/10.1109/infocom48880.2022.9796922openalex-snapshot
Network Link Weight Setting: A Machine Learning Based Approach
inferred← citeshttps://doi.org/10.1109/isa.2008.36openalex-snapshot
A Survey for Open Shortest Path First Weight Setting (OSPFWS) Problem
inferred← citeshttps://doi.org/10.1109/jsyst.2017.2788053openalex-snapshot
Metaheuristics in Telecommunication Systems: Network Design, Routing, and Allocation Problems
inferred← citeshttps://doi.org/10.1109/lcn.2009.5355109openalex-snapshot
Optimizing link weight in OSPF routing under unknown traffic matrices
inferred← citeshttps://doi.org/10.1109/lcomm.2010.06.100363openalex-snapshot
PSO: preventive start-time optimization of OSPF link weights to counter network failure
inferred← citeshttps://doi.org/10.1109/ncca.2011.13openalex-snapshot
Dynamic IGP Weight Optimization in IP Networks
inferred← citeshttps://doi.org/10.1109/ngdn61651.2024.10744156openalex-snapshot
Network link weight optimization based on antisymmetric deep graph networks and reinforcement learning
inferred← citeshttps://doi.org/10.1109/noms59830.2024.10575472openalex-snapshot
Virtual Multi-Topology Routing for QoS Constraints
inferred← citeshttps://doi.org/10.1109/siu.2005.1567741openalex-snapshot
Routing optimization techniques for communication networks
inferred← citeshttps://doi.org/10.1109/tnet.2020.2987866openalex-snapshot
Traffic Engineering in Partially Deployed Segment Routing Over IPv6 Network With Deep Reinforcement Learning
inferred← citeshttps://doi.org/10.1109/tnsm.2020.3045145openalex-snapshot
Preventive Start-Time Optimization to Determine Link Weights Against Probabilistic Link Failures
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.1111/j.1475-3995.2010.00769.xopenalex-snapshot
Efficient techniques and tools for intra-domain traffic engineering
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00771.xopenalex-snapshot
A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
inferred← citeshttps://doi.org/10.1111/j.1475-3995.2010.00776.xopenalex-snapshot
Applications of meta-heuristics to traffic engineering in IP networks
inferred← citeshttps://doi.org/10.1145/2908961.2926996openalex-snapshot
Biased Ranom-Key Genetic Algorithms
inferred← citeshttps://doi.org/10.1145/2935634.2935636openalex-snapshot
On the Interplay of Link-Flooding Attacks and Traffic Engineering
inferred← citeshttps://doi.org/10.1145/3820441.3821222openalex-snapshot
RepuSat: A Stability-Aware Routing for Laser Satellite Network via Link Reputation Dampening
inferred← citeshttps://doi.org/10.1287/ijoc.1070.0231openalex-snapshot
Speeding Up Dynamic Shortest-Path Algorithms
inferred← citeshttps://doi.org/10.13037/ria.vol4n2.312openalex-snapshot
Evolutionary Computation in Brazil: A Review of the Literature in Two Databases
inferred← citeshttps://doi.org/10.15368/theses.2012.157openalex-snapshot
NEURAL NETWORKS PERFORMANCE AND STRUCTURE OPTIMIZATION USING GENETIC ALGORITHMS
inferred← citeshttps://doi.org/10.1587/transcom.2016ebp3134openalex-snapshot
Link Weight Optimization Scheme for Link Reinforcement in IP Networks
inferred← citeshttps://doi.org/10.1587/transcom.2016ebp3370openalex-snapshot
Preventive Start-Time Optimization Considering Both Failure and Non-Failure Scenarios
inferred← citeshttps://doi.org/10.1587/transcom.e94.b.1964openalex-snapshot
Optimization of OSPF Link Weights to Counter Network Failure
inferred← citeshttps://doi.org/10.26512/ripe.v2i10.21730openalex-snapshot
ALGORITMO GENÉTICO BASEADO EM CHAVES ALEATÓRIAS PARA O ORIENTEERING PROBLEM WITH TIME WINDOWS
inferred← citeshttps://doi.org/10.3837/tiis.2016.02.006openalex-snapshot
Geolocation Spectrum Database Assisted Optimal Power Allocation: Device-to-Device Communications in TV White Space
inferred← citeshttps://doi.org/10.4018/978-1-5225-6029-6.ch009openalex-snapshot
Meta-Heuristic Approach for Software Project Risk Schedule Analysis
inferred← citeshttps://doi.org/10.4108/icst.valuetools2008.4500openalex-snapshot
GATEway: symbiotic inter-domain traffic engineering
inferred← citeshttps://doi.org/10.47749/t/unicamp.2003.299805openalex-snapshot
Roteamento do trafego na Internet
inferred← citeshttps://doi.org/10.47749/t/unicamp.2017.987457openalex-snapshot
Otimização das configurações de redes de distribuição de energia elétrica com fontes distribuídas
inferred← citeshttps://doi.org/10.5121/ijaia.2015.6503openalex-snapshot
Multi-Objective Optimization using Genetic Algorithms in MOTSP (Co2 Emissions)
inferred← citeshttps://doi.org/10.5121/ijcnc.2011.3111openalex-snapshot
OSPF Weight Setting Optimization for Single Link Failures
inferred← citeshttps://doi.org/10.5555/1558720.1558721openalex-snapshot
Parallel tabu search for optimizing the OSPF weight setting problem
inferred← citeshttps://doi.org/10.59254/sbpo-2019-106668openalex-snapshot
ALGORITMO GENÉTICO DE CHAVES ALEATÓRIAS VICIADAS PARA O PROBLEMA DE ALOCAÇÃO DE BANCOS DE CAPACITORES EM SISTEMAS DE DISTRIBUIÇÃO DE ENERGIA ELÉTRICA
inferred← citeshttps://doi.org/10.7177/sg.2006.sgv1n2a2openalex-snapshot
Um Algoritmo Evolutivo para o Problema de Roteamento em Arcos Capacitados
inferred← citeshttps://doi.org/10.7282/t3571bb2openalex-snapshot
Column generation and network modeling in large-scale logistics networks
inferred← citeshttps://doi.org/10.82444/warw.33634597openalex-snapshot
Multipath selection for resilient network routing
inferred← citeshttps://doi.org/10.9708/jksci.2014.19.1.119openalex-snapshot
Genetic Algorithm based Pathfinding System for Analyzing Networks
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.