Pages that link to "Item:Q2569035"
From MaRDI portal
The following pages link to Using tree search bounds to enhance a genetic algorithm approach to two rectangle packing problems (Q2569035):
Displaying 6 items.
- A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
- Decomposition based hybrid metaheuristics (Q319285) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems (Q610988) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5891242) (← links)
- Combining metaheuristics with mathematical programming, constraint programming and machine learning (Q5925164) (← links)
