Pages that link to "Item:Q4804169"

The following pages link to A GRASP with path-relinking for private virtual circuit routing (Q4804169):

Displaying 26 items.

• Community detection by modularity maximization using GRASP with path relinking (Q336716) (← links)
• Power optimization in ad hoc wireless network topology control with biconnectivity requirements (Q336735) (← links)
• Optimizing server placement in distributed systems in the presence of competition (Q635301) (← links)
• Restart strategies for GRASP with path-relinking heuristics (Q691439) (← links)
• A conic quadratic formulation for a class of convex congestion functions in network flow problems (Q713098) (← links)
• GRASP with path-relinking for the generalized quadratic assignment problem (Q763245) (← links)
• Routing and wavelength assignment by partition colouring (Q819072) (← links)
• Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks (Q953207) (← links)
• GRASP for set packing problems. (Q1420382) (← links)
• GRASP with exterior path-relinking and restricted local search for the multidimensional two-way number partitioning problem (Q1652080) (← links)
• GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times (Q1945095) (← links)
• The multi-parent biased random-key genetic algorithm with implicit path-relinking and its real-world applications (Q2028795) (← links)
• A multi-objective model for environmental investment decision making (Q2384603) (← links)
• Solving two location models with few facilities by using a hybrid heuristic: a real health resources case (Q2387294) (← links)
• TTT plots: a perl program to create time-to-target plots (Q2468777) (← links)
• Path relinking for the vehicle routing problem (Q2491329) (← links)
• Scatter search --- wellsprings and challenges (Q2570140) (← links)
• A GRASP and path relinking heuristic for rural road network development (Q2573003) (← links)
• An evolutionary algorithm based hyper-heuristic framework for the set packing problem (Q2656742) (← links)
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem (Q3057122) (← links)
• A branch-and-cut algorithm for partition coloring (Q3057147) (← links)
• Extending time‐to‐target plots to multiple instances (Q4624885) (← links)
• Probabilistic stopping rules for GRASP heuristics and extensions (Q4924054) (← links)
• Lot-sizing for production planning in a recovery system with returns (Q5247676) (← links)
• A Hybrid Metaheuristic for Routing on Multicast Networks (Q5265221) (← links)
• The invisible‐hand heuristic for origin‐destination integer multicommodity network flows (Q6065841) (← links)