Pages that link to "Item:Q1194741"
From MaRDI portal
The following pages link to An and-or-graph approach for two-dimensional cutting problems (Q1194741):
Displaying 20 items.
- 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)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems (Q1127217) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- An and-or-graph approach for two-dimensional cutting problems (Q1194741) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← links)
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach (Q1278342) (← links)
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems (Q1278579) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for unconstrained three-dimensional cutting problems: A comparative study (Q1433163) (← links)
- Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems (Q1991111) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects (Q2803261) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)
- An introduction to the two‐dimensional rectangular cutting and packing problem (Q6056889) (← links)
