Pages that link to "Item:Q2803255"
From MaRDI portal
The following pages link to One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model (Q2803255):
Displaying 11 items.
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- A new model for complete solutions to one-dimensional cutting stock problems. (Q1417501) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Alternative configurations for cutting machines in a tube cutting mill (Q2643969) (← links)
- New integer programming formulations and an exact algorithm for the ordered cutting stock problem (Q3394020) (← links)
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization (Q6067890) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries (Q6087622) (← links)
- One-dimensional stock cutting resilient against singular random defects (Q6106587) (← links)
- Models for two-dimensional bin packing problems with customer order spread (Q6621849) (← links)