Pages that link to "Item:Q2803254"

The following pages link to A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254):

Displaying 16 items.

• A Python/C++ library for bound-constrained global optimization using a biased random-key genetic algorithm (Q498446) (← links)
• Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← links)
• A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← 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)
• Efficient approaches for the flooding problem on graphs (Q2178332) (← links)
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
• A biased random-key genetic algorithm for single-round divisible load scheduling (Q2806431) (← links)
• A Genetic Algorithm for Scheduling Alternative Tasks Subject to Technical Failure (Q5270510) (← 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)
• A multistart biased random key genetic algorithm for the flexible job shop scheduling problem with transportation (Q6079857) (← links)
• Mathematical models for the minimization of open stacks problem (Q6082193) (← links)
• The capacitated family traveling salesperson problem (Q6195021) (← links)
• Optimizing job shop scheduling with speed-adjustable machines and peak power constraints: a mathematical model and heuristic solutions (Q6609707) (← links)