Pages that link to "Item:Q1178994"

The following pages link to Cutting stock problems and solution procedures (Q1178994):

Displaying 46 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)
• 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)
• 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)
• A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) (← links)
• Random search in the one-dimensional cutting stock problem (Q1278375) (← links)
• Setup minimising conditions in the trim loss problem (Q1278430) (← 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)
• An interactive technique for the cutting stock problem with multiple objectives (Q1342019) (← links)
• Optimization of roll cutting in clothing industry (Q1366704) (← links)
• An exact algorithm for general, orthogonal, two-dimensional knapsack problems (Q1388927) (← 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)
• 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)
• 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)
• A population heuristic for constrained two-dimensional non-guillotine cutting (Q1877899) (← links)
• A simulated annealing approach to the nesting problem in the textile manufacturing industry (Q1897378) (← links)
• Interactive procedures in large-scale two-dimensional cutting stock problems (Q1919382) (← links)
• An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem (Q2158621) (← links)
• Bidirectional best-fit heuristic for orthogonal rectangular strip packing (Q2267317) (← links)
• A branch-and-price algorithm for the temporal bin packing problem (Q2337386) (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
• Solving a combined cutting-stock and lot-sizing problem with a column generating procedure (Q2482385) (← links)
• A hybrid heuristic to reduce the number of different patterns in cutting stock problems (Q2489315) (← links)
• A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem (Q2643948) (← links)
• A hybrid genetic algorithm for the two-dimensional single large object placement problem (Q2643949) (← links)
• A hybrid genetic algorithm-heuristic for a two-dimensional orthogonal packing problem (Q2643953) (← links)
• Diversity of solutions: an exploration through the lens of fixed-parameter tractability theory (Q2667823) (← links)
• A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)