Pages that link to "Item:Q1127219"
From MaRDI portal
The following pages link to An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219):
Displayed 16 items.
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← links)
- Maximizing revenue with allocation of multiple advertisements on a Web banner (Q632692) (← links)
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns (Q652857) (← links)
- Fast heuristic for constrained homogenous T-shape cutting patterns (Q693480) (← links)
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem (Q842766) (← links)
- Two-stage general block patterns for the two-dimensional cutting problem (Q878556) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- A recursive exact algorithm for weighted two-dimensional cutting (Q1278248) (← 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)
- Solving packing problems by a distributed global optimization algorithm (Q1955364) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- Generating optimal two-section cutting patterns for rectangular blanks (Q2581593) (← links)
- Applying genetic algorithms and neural networks to the container loading problem (Q4469156) (← links)
- Recursive algorithm for the two‐dimensional cutting problem of punched strips (Q5190526) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)