Pages that link to "Item:Q3087853"

The following pages link to A biased random-key genetic algorithm for OSPF and DEFT routing to minimize network congestion (Q3087853):

Displaying 11 items.

• A biased random-key genetic algorithm to maximize the number of accepted lightpaths in WDM optical networks (Q312488) (← links)
• A GRASP with path-relinking heuristic for the survivable IP/MPLS-over-WSON multi-layer network optimization problem (Q336733) (← links)
• A biased random-key genetic algorithm for the capacitated minimum spanning tree problem (Q337493) (← links)
• A biased random-key genetic algorithm for road congestion minimization (Q601986) (← links)
• A genetic algorithm for the weight setting problem in OSPF routing (Q1610662) (← links)
• Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
• A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing (Q5318276) (← links)
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls (Q6066301) (← links)
• Model and methods to address urban road network problems with disruptions (Q6069920) (← links)
• A matheuristic approach for the minimum broadcast time problem using a biased random‐key genetic algorithm (Q6082271) (← links)