Pages that link to "Item:Q1091269"
From MaRDI portal
The following pages link to Near-optimal solutions to one-dimensional cutting stock problems (Q1091269):
Displaying 16 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An investigation into two bin packing problems with ordering and orientation implications (Q421577) (← links)
- A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem (Q941555) (← links)
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems (Q1101337) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- Solving binary cutting stock problems by column generation and branch- and-bound (Q1326509) (← links)
- Solving a cutting problem based on existing patterns (Q1333483) (← links)
- Heuristic methods for gang-rip saw arbor design. (Q1420446) (← links)
- A one-dimensional cutting stock problem in the aluminium industry and its solution (Q1825753) (← links)
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths (Q1847195) (← links)
- A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry (Q1847199) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- Accelerating column generation for variable sized bin-packing problems (Q2643963) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- A column generation procedure for gang-rip saw arbor design and scheduling (Q4230062) (← links)
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)
