The following pages link to (Q4321918):
Displaying 9 items.
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container (Q1847196) (← links)
- Exact solution techniques for two-dimensional cutting and packing (Q2029021) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- An enumeration scheme to generate constrained exact checkerboard patterns (Q2462561) (← links)
- Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem (Q2566944) (← links)
- An integrated cutting stock and sequencing problem (Q2643965) (← links)
- Optimising the cutting of wood fibre plates in the hardboard industry (Q2643972) (← links)
