Pages that link to "Item:Q1825766"

The following pages link to An LP-based approach to cutting stock problems with multiple objectives (Q1825766):

Displayed 12 items.

• Enforcing minimum run length in the cutting stock problem (Q817568) ‎ (← links)
• A simulated annealing heuristic for the one-dimensional cutting stock problem (Q1268138) ‎ (← 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 interactive technique for the cutting stock problem with multiple objectives (Q1342019) ‎ (← links)
• An algorithm for the determination of optimal cutting patterns (Q1348556) ‎ (← links)
• A combined approach to the solution to the general one-dimensional cutting stock problem (Q1777156) ‎ (← links)
• A typology of cutting and packing problems (Q1825761) ‎ (← links)
• The nesting problem in the leather manufacturing industry (Q1897382) ‎ (← links)
• An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) ‎ (← links)
• An improved typology of cutting and packing problems (Q2643945) ‎ (← links)
• A note on the approximability of cutting stock problems (Q2643962) ‎ (← links)