Pages that link to "Item:Q1178994"
From MaRDI portal
The following pages link to Cutting stock problems and solution procedures (Q1178994):
Displaying 50 items.
- Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges (Q296762) (← links)
- A hybrid evolutionary algorithm for the two-dimensional packing problem (Q301327) (← links)
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- Heuristic for constrained T-shape cutting patterns of rectangular pieces (Q339642) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- Enforcing minimum run length in the cutting stock problem (Q817568) (← links)
- Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
- An integer programming model for two- and three-stage two-dimensional cutting stock problems (Q976382) (← links)
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths (Q1001001) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- An integrated approach to the one-dimensional cutting stock problem in coronary stent manufacturing (Q1027566) (← links)
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting (Q1039779) (← links)
- Strips minimization in two-dimensional cutting stock of circular items (Q1040959) (← links)
- Near-optimal solutions to one-dimensional cutting stock problems (Q1091269) (← links)
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
- A sequential heuristic procedure for one-dimensional cutting (Q1124716) (← links)
- An approximation algorithm for solving unconstrained two-dimensional knapsack problems (Q1127219) (← links)
- Packing different-sized circles into a rectangular container (Q1127229) (← 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)
- A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
- Determining cutting stock patterns when defects are present (Q1270617) (← links)
- The solution of two-stage guillotine cutting stock problems having extremely varying order demands (Q1278246) (← links)
- Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
- Setup minimising conditions in the trim loss problem (Q1278430) (← links)
- New cases of the cutting stock problem having MIRUP (Q1298738) (← links)
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (Q1318665) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- Solution procedures for cutting lumber into furniture parts (Q1328641) (← links)
- Procedures for solving a 1-dimensional cutting problem (Q1333482) (← links)
- An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- Optimization of roll cutting in clothing industry (Q1366704) (← links)
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← links)
- A method for the cutting stock problem with different qualities (Q1388928) (← links)
- Improving competitiveness in veneers production by a simple-to-use DSS. (Q1426707) (← links)
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem (Q1592734) (← links)
- Improving blood products supply through donation tailoring (Q1628111) (← links)
- Two-dimensional cutting stock problem with sequence dependent setup times (Q1681356) (← links)
- Rectangle blanket problem: binary integer linear programming formulation and solution algorithms (Q1735167) (← links)
- Optimal and heuristic solutions for a scheduling problem arising in a foundry (Q1772868) (← links)
- A hybrid approach for optimization of one-dimensional cutting (Q1809853) (← links)
- Wastage reduction in wood cutting (Q1820679) (← links)
- Knowledge-based systems for cutting stock problems (Q1825760) (← links)
- One-dimensional cutting stock decisions for rolls with multiple quality grades (Q1825762) (← links)
- The cutting stock problem in the canvas industry (Q1825765) (← links)
- An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
- An effective quasi-human based heuristic for solving the rectangle packing problem (Q1847202) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
