Pages that link to "Item:Q2803254"
From MaRDI portal
The following pages link to A biased random-key genetic algorithm for the minimization of open stacks problem (Q2803254):
Displayed 11 items.
- Solving the set packing problem via a maximum weighted independent set heuristic (Q826368) (← 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)