Pages that link to "Item:Q1610662"

The following pages link to A genetic algorithm for the weight setting problem in OSPF routing (Q1610662):

Displaying 42 items.

• A hybrid biased random key genetic algorithm for the quadratic assignment problem (Q280940) (← links)
• 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 unequal area facility layout problem (Q319725) (← links)
• A hybrid biased random key genetic algorithm approach for the unit commitment problem (Q405676) (← links)
• Finding multiple roots of a box-constrained system of nonlinear equations with a biased random-key genetic algorithm (Q486399) (← links)
• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
• Heuristics for the data arrangement problem on regular trees (Q498454) (← 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)
• Increasing internet capacity using local search (Q702469) (← links)
• Better alternatives to OSPF routing (Q818835) (← links)
• Optimal oblivious routing under linear and ellipsoidal uncertainty (Q1039914) (← links)
• A hybrid primal heuristic for finding feasible solutions to mixed integer programs (Q1695014) (← links)
• Heuristics for a flowshop scheduling problem with stepwise job objective function (Q1754167) (← links)
• A parallel multi-population biased random-key genetic algorithm for a container loading problem (Q1761962) (← links)
• A tabu search algorithm for the routing and capacity assignment problem in computer networks (Q1781553) (← links)
• Biased random-key genetic algorithms with applications in telecommunications (Q1935883) (← links)
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
• Heuristics for the dynamic facility location problem with modular capacities (Q2029361) (← links)
• Multiobjective design of survivable IP networks (Q2379874) (← links)
• Genetic local search for multicast routing with pre-processing by logarithmic simulated annealing (Q2462555) (← links)
• A genetic algorithm for the resource constrained multi-project scheduling problem (Q2482793) (← links)
• An algorithm for the maximum likelihood problem on evolutionary trees (Q2576441) (← links)
• A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431) (← links)
• A Parallel Routing Algorithm for Traffic Optimization (Q2917220) (← links)
• Self avoiding paths routing algorithm in scale-free networks (Q2944678) (← 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)
• Transport optimization on complex networks (Q3624815) (← links)
• IMPROVED EFFICIENT ROUTING STRATEGY ON SCALE-FREE NETWORKS (Q4918284) (← links)
• A hybrid genetic algorithm for the weight setting problem in OSPF/IS‐IS routing (Q5318276) (← links)
• Routing and Capacity Optimization for IP Networks (Q5391869) (← links)
• (Q5491205) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5900973) (← links)
• Intra-domain traffic engineering with shortest path routing protocols (Q5919993) (← links)
• Designing Reliable IP Networks with an Access/Edge/Core Hierarchical Structure (Q6160201) (← links)
• Two-stage algorithm for bi-objective black-box traffic engineering (Q6588737) (← links)