Pages that link to "Item:Q1143942"
From MaRDI portal
The following pages link to The trim-loss and assortment problems: A survey (Q1143942):
Displaying 50 items.
- An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
- Trim loss optimization by an improved differential evolution (Q474531) (← links)
- A two-objective mathematical model without cutting patterns for one-dimensional assortment problems (Q555147) (← links)
- A linear optimization approach to the combined production planning model (Q647983) (← links)
- Minimizing trim loss in cutting rectangular blanks of a single size from a rectangular sheet using orthogonal guillotine cuts (Q684319) (← links)
- Classification and literature review of integrated lot-sizing and cutting stock problems (Q724044) (← links)
- An algorithm for the two-dimensional assortment problem (Q759646) (← links)
- Network flows and non-guillotine cutting patterns (Q795062) (← links)
- A heuristic approach to the lumber allocation problem in hardwood dimension and furniture manufacturing (Q806790) (← links)
- The constrained compartmentalised knapsack problem (Q868151) (← links)
- A coupling cutting stock-lot sizing problem in the paper industry (Q940851) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- The stochastic trim-loss problem (Q1011257) (← links)
- The one-dimensional cutting stock problem with usable leftover - a heuristic approach (Q1041932) (← links)
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
- A dynamic programming based heuristic for industrial buying of cardboard (Q1111922) (← links)
- An LP-based approach to a two-stage cutting stock problem (Q1127213) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Exact solutions for constrained two-dimensional cutting problems (Q1127220) (← links)
- The trim-loss and assortment problems: A survey (Q1143942) (← links)
- Composite stock cutting through simulated annealing (Q1197089) (← links)
- Limiting the number of each piece in two-dimensional cutting stock patterns (Q1197090) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Packing problems (Q1197916) (← links)
- Solution for the constrained Guillotine cutting problem by simulated annealing (Q1265860) (← links)
- Solving a two-dimensional trim-loss with MILP (Q1291689) (← links)
- Different transformations for solving non-convex trim-loss problems by MINLP (Q1291782) (← links)
- An approximately global optimization method for assortment problems (Q1291783) (← links)
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (Q1318665) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- An algorithm for the determination of optimal cutting patterns (Q1348556) (← links)
- Effective methods for a container packing operation (Q1361222) (← links)
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts (Q1388926) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- The cutting stock problem in a hardboard industry: A case study. (Q1406647) (← links)
- Exact algorithms for the guillotine strip cutting/packing problem. (Q1406705) (← links)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← links)
- Combined cutting stock and lot-sizing problem with pattern setup (Q1652627) (← links)
- A mixed-integer programming model for a class of assortment problems (Q1804067) (← links)
- A two-phase roll cutting problem (Q1825752) (← links)
- An improved version of Wang's algorithm for two-dimensional cutting problems (Q1825758) (← links)
- Knowledge-based systems for cutting stock problems (Q1825760) (← links)
- A typology of cutting and packing problems (Q1825761) (← links)
- Optimal solutions for the cutting stock problem (Q1825768) (← links)
- Reel and sheet cutting at a paper mill (Q1885980) (← links)
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost (Q2003581) (← links)
- The maximum diversity assortment selection problem (Q2040441) (← links)
- Modified greedy heuristic for the one-dimensional cutting stock problem (Q2051915) (← links)
- A residual recombination heuristic for one-dimensional cutting stock problems (Q2121621) (← links)