A genetic algorithm for the weight setting problem in OSPF routing
From MaRDI portal
Publication:1610662
DOI10.1023/A:1014852026591zbMath1068.90092OpenAlexW1509050436MaRDI QIDQ1610662
Publication date: 20 August 2002
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1023/a:1014852026591
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (37)
A hybrid biased random key genetic algorithm for the quadratic assignment problem ⋮ A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks ⋮ Multiobjective design of survivable IP networks ⋮ A biased random-key genetic algorithm for the unequal area facility layout problem ⋮ A Parallel Routing Algorithm for Traffic Optimization ⋮ A biased random-key genetic algorithm for road congestion minimization ⋮ Self avoiding paths routing algorithm in scale-free networks ⋮ Biased random-key genetic algorithms with applications in telecommunications ⋮ A hybrid biased random key genetic algorithm approach for the unit commitment problem ⋮ A hybrid primal heuristic for finding feasible solutions to mixed integer programs ⋮ Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure ⋮ An Integer Programming Algorithm for Routing Optimization in IP Networks ⋮ Routing and Capacity Optimization for IP Networks ⋮ Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm ⋮ Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing ⋮ A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm ⋮ Heuristics for the data arrangement problem on regular trees ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ Heuristics for a flowshop scheduling problem with stepwise job objective function ⋮ IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS ⋮ A genetic algorithm for the resource constrained multi-project scheduling problem ⋮ A parallel multi-population biased random-key genetic algorithm for a container loading problem ⋮ Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE ⋮ An integer programming algorithm for routing optimization in IP networks ⋮ Intra-domain traffic engineering with shortest path routing protocols ⋮ A tabu search algorithm for the routing and capacity assignment problem in computer 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 ⋮ A biased random-key genetic algorithm for single-round divisible load scheduling ⋮ Transport optimization on complex networks ⋮ Applications of meta-heuristics to traffic engineering in IP networks ⋮ Efficient techniques and tools for intra-domain traffic engineering ⋮ A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion ⋮ Optimization of OSPF Routing in IP Networks ⋮ Optimal oblivious routing under linear and ellipsoidal uncertainty ⋮ An algorithm for the maximum likelihood problem on evolutionary trees
This page was built for publication: A genetic algorithm for the weight setting problem in OSPF routing
