Pages that link to "Item:Q3157808"
From MaRDI portal
The following pages link to An efficient approach for large-scale two-dimensional guillotine cutting stock problems (Q3157808):
Displaying 40 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems (Q337083) (← links)
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem (Q439644) (← 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)
- 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)
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem (Q726225) (← links)
- Exact algorithm for generating two-segment cutting patterns of punched strips (Q837733) (← 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)
- T-shape homogeneous block patterns for the two-dimensional cutting problem (Q933804) (← links)
- A recursive algorithm for constrained two-dimensional cutting problems (Q1029631) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- An application of simulated annealing to the cutting stock problem (Q1124712) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- An algorithm for the 2D guillotine cutting stock problem (Q1309924) (← links)
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock (Q1370660) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- A comparative numerical analysis for the guillotine two-dimensional cutting problem (Q1593538) (← links)
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
- A new dynamic programming procedure for three-staged cutting patterns (Q1941034) (← links)
- Strip based compact formulation for two-dimensional guillotine cutting problems (Q2108139) (← links)
- 2DPackLib: a two-dimensional cutting and packing library (Q2115308) (← links)
- An EDA for the 2D knapsack problem with guillotine constraint (Q2418151) (← links)
- Simple block patterns for the two-dimensional cutting problem (Q2473240) (← links)
- Efficient algorithm for the constrained two-dimensional cutting stock problem (Q2767721) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Using GPU computing for solving the two-dimensional guillotine cutting problem (Q2830956) (← links)
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems (Q2967574) (← links)
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces (Q3401326) (← links)
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems (Q3401336) (← links)
- (Q3745624) (← links)
- An approach to two-dimensional cutting stock problems (Q3753794) (← links)
- A Scalable Approach for the K-Staged Two-Dimensional Cutting Stock Problem (Q4596237) (← links)
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem (Q4814179) (← links)
- Lp-Based Method For The Multi-Sheet Cutting Stock Problem (Q4834077) (← links)
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems (Q5959380) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- Exact approaches for the unconstrained two-dimensional cutting problem with defects (Q6068735) (← links)
