Pages that link to "Item:Q3394020"
From MaRDI portal
The following pages link to New integer programming formulations and an exact algorithm for the ordered cutting stock problem (Q3394020):
Displaying 4 items.
- The one-dimensional cutting stock problem with due dates (Q1038325) (← links)
- A method for solving the minimization of the maximum number of open stacks problem within a cutting process (Q1886499) (← links)
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255) (← links)
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem (Q5321741) (← links)