Pages that link to "Item:Q5318276"
From MaRDI portal
The following pages link to A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing (Q5318276):
Displayed 26 items.
- A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
- A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
- A survey of repair methods used as constraint handling techniques in evolutionary algorithms (Q458493) (← links)
- Linear programming models for traffic engineering in 100\% survivable networks under combined IS-IS/OSPF and MPLS-TE (Q547138) (← links)
- An integer programming algorithm for routing optimization in IP networks (Q547285) (← links)
- A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
- A random key based genetic algorithm for the resource constrained project scheduling problem (Q947946) (← links)
- Redundant multicast routing in multilayer networks with shared risk resource groups: complexity, models and algorithms (Q976036) (← links)
- Optimal configuration of power distribution networks with variable renewable energy resources (Q1652686) (← links)
- A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
- Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
- Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
- Multiobjective design of survivable IP networks (Q2379874) (← links)
- Mathematical programming approaches for dual multicast routing problem with multilayer risk cost (Q2393468) (← links)
- TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
- A genetic algorithm for the resource constrained multi-project scheduling problem (Q2482793) (← links)
- Real-time monitoring of undirected networks: Articulation points, bridges, and connected and biconnected components (Q2894245) (← links)
- Approximability of unsplittable shortest path routing problems (Q3057101) (← links)
- Applications of meta-heuristics to traffic engineering in IP networks (Q3087845) (← links)
- Efficient techniques and tools for intra-domain traffic engineering (Q3087851) (← links)
- A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853) (← links)
- Optimization of OSPF Routing in IP Networks (Q3404471) (← links)
- An Integer Programming Algorithm for Routing Optimization in IP Networks (Q3541087) (← links)
- Routing and Capacity Optimization for IP Networks (Q5391869) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
- Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)