Pages that link to "Item:Q4367016"
From MaRDI portal
The following pages link to An algorithm for a cutting stock problem on a strip (Q4367016):
Displaying 14 items.
- Fast pattern-based algorithms for cutting stock (Q337047) (← links)
- A new heuristic for rectangular stock-cutting problem (Q646775) (← links)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction (Q954060) (← links)
- An effective solution for a real cutting stock problem in manufacturing plastic rolls (Q1026560) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- On the effectivity of gradient methods for cutting stock problems (Q1342431) (← links)
- Approximation solutions for the cutting stock `portfolio' problem (Q1825733) (← links)
- Pattern minimisation in cutting stock problems (Q1961237) (← links)
- An application of deterministic and robust optimization in the wood cutting industry (Q2342918) (← links)
- An improved typology of cutting and packing problems (Q2643945) (← links)
- Roll cutting in the curtain industry, or: a well-solvable allocation problem (Q2643970) (← links)
- A matching approach for replenishing rectangular stock sizes (Q3156528) (← links)
- A Heuristic Algorithm for the Guillotine Constrained Cutting Stock Problem (Q4030932) (← links)
- Recursive algorithm for the two‐dimensional cutting problem of punched strips (Q5190526) (← links)