Pages that link to "Item:Q1127217"
From MaRDI portal
The following pages link to An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217):
Displayed 17 items.
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- An exact depth-first algorithm for the pallet loading problem (Q1303552) (← links)
- An efficient algorithm for searching implicit AND/OR graphs with cycles (Q1589573) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
- Solving the pallet loading problem (Q2384612) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem (Q2643950) (← links)
- The one dimensional Compartmentalised Knapsack problem: a case study (Q2643951) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- The pinwheel pattern and its application to the manufacturer's pallet-loading problem (Q3401334) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)
- Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor (Q5189098) (← links)
- A fast algorithm for two-dimensional pallet loading problems of large size (Q5945208) (← links)