Pages that link to "Item:Q2643949"
From MaRDI portal
The following pages link to A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949):
Displaying 14 items.
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- A scheduling framework for large-scale, parallel, and topology-aware applications (Q666224) (← links)
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem (Q1662642) (← links)
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects (Q2189880) (← links)
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers (Q2294074) (← links)
- The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers (Q2691324) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- An algorithm for the constrained two-dimensional rectangular multiple identical large object placement problem (Q3514843) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
