A genetic algorithm for the weight setting problem in OSPF routing
From MaRDI portal
Recommendations
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Increasing internet capacity using local search
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- On open shortest path first related network optimisation problems
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
Cited in
(45)- A biased random-key genetic algorithm for single-round divisible load scheduling
- Optimal oblivious routing under linear and ellipsoidal uncertainty
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion
- Biased random-key genetic algorithms with applications in telecommunications
- A biased random-key genetic algorithm for road congestion minimization
- An integer programming algorithm for routing optimization in IP networks
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE
- Improved efficient routing strategy on scale-free networks
- A hybrid biased random key genetic algorithm for the quadratic assignment problem
- An Integer Programming Algorithm for Routing Optimization in IP Networks
- Applications of meta-heuristics to traffic engineering in IP networks
- Efficient techniques and tools for intra-domain traffic engineering
- A Parallel Routing Algorithm for Traffic Optimization
- Priority-Based Genetic Algorithm for Shortest Path Routing Problem in OSPF
- Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing
- Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure
- Two-stage algorithm for bi-objective black-box traffic engineering
- Intra-domain traffic engineering with shortest path routing protocols
- Multiobjective design of survivable IP networks
- Approximability of unsplittable shortest path routing problems
- The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications
- Heuristics for the dynamic facility location problem with modular capacities
- Optimization of OSPF routing in IP networks
- A tabu search algorithm for the routing and capacity assignment problem in computer networks
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks
- A biased random-key genetic algorithm for the unequal area facility layout problem
- A hybrid biased random key genetic algorithm approach for the unit commitment problem
- Transport optimization on complex networks
- A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing
- Routing and capacity optimization for IP networks
- Self avoiding paths routing algorithm in scale-free networks
- A genetic algorithm for the resource constrained multi-project scheduling problem
- scientific article; zbMATH DE number 5061975 (Why is no real title available?)
- A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm
- Increasing internet capacity using local search
- Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm
- A parallel multi-population biased random-key genetic algorithm for a container loading problem
- On open shortest path first related network optimisation problems
- Heuristics for the data arrangement problem on regular trees
- A hybrid primal heuristic for finding feasible solutions to mixed integer programs
- Computational Science – ICCS 2005
- An algorithm for the maximum likelihood problem on evolutionary trees
- Heuristics for a flowshop scheduling problem with stepwise job objective function
- Intra-domain traffic engineering with shortest path routing protocols
- Better alternatives to OSPF routing
This page was built for publication: A genetic algorithm for the weight setting problem in OSPF routing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1610662)
