Pages that link to "Item:Q1809825"

The following pages link to A hierarchical approach for one-dimensional cutting stock problems in the steel industry that maximizes yield and minimizes overgrading (Q1809825):

Displaying 7 items.

• The cutting stock problem for large sections in the iron and steel industries (Q1062609) (← links)
• A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (Q1318665) (← links)
• Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
• A nested column generation algorithm to the meta slab allocation problem in the steel making industry (Q3055414) (← links)
• A comprehensive empirical demonstration of the impact of choice constraints on solving generalizations of the 0–1 knapsack problem using the integer programming option of CPLEX^® (Q5059432) (← links)
• Simple strategies that generate bounded solutions for the multiple‐choice multi‐dimensional knapsack problem: a guide for OR practitioners (Q6080629) (← links)
• A practical approach for dealing with hard knapsack problems using general-purpose integer programming software (Q6659825) (← links)