Pages that link to "Item:Q1039779"
From MaRDI portal
The following pages link to A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779):
Displaying 7 items.
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects (Q480780) (← links)
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem (Q610985) (← links)
- UGC: An algorithm for two-stage unconstrained guillotine cutting (Q1127189) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem (Q2099494) (← links)
- (Q4368559) (← links)