Pages that link to "Item:Q2806431"

The following pages link to A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431):

Displaying 10 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 field Technician scheduling problem (Q342506) (← links)
• A biased random-key genetic algorithm for routing and wavelength assignment under a sliding scheduled traffic model (Q785640) (← links)
• Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
• A biased random-key genetic algorithm for the maximum quasi-clique problem (Q1653365) (← links)
• A biased random-key genetic algorithm for the set orienteering problem (Q2030452) (← links)
• An iterative biased‐randomized heuristic for the fleet size and mix vehicle‐routing problem with backhauls (Q6066301) (← links)
• A biased‐randomized algorithm for redistribution of perishable food inventories in supermarket chains (Q6066639) (← links)
• A biased‐randomized iterated local search for the distributed assembly permutation flow‐shop problem (Q6069764) (← links)
• Agile optimization of a two‐echelon vehicle routing problem with pickup and delivery (Q6070418) (← links)