Pages that link to "Item:Q3401328"
From MaRDI portal
The following pages link to Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328):
Displaying 12 items.
- A hybrid constraint programming approach to a wood procurement problem with bucking decisions (Q272019) (← links)
- Planning production using mathematical programming: The case of a woodturning company (Q1013389) (← links)
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems (Q1754107) (← links)
- Efficient algorithms for real-life instances of the variable size bin packing problem (Q1761234) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Application of Linear Programming in a Gauze Splitting Operation (Q4868796) (← links)
- A branch-and-bound algorithm for solving a fixed charge problem in the profit optimization of sawn timber production (Q5202833) (← links)
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers (Q6069766) (← links)
- A cutting stock problem in the wood products industry: a two‐stage solution approach (Q6070877) (← links)
- Comparison of discrete- and continuous-time models for scheduling waste wood processing facilities (Q6166947) (← links)
