Pages that link to "Item:Q4282749"
From MaRDI portal
The following pages link to The One Dimensional Cutting Stock Problem Using Two Objectives (Q4282749):
Displaying 16 items.
- Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application (Q706851) (← links)
- Algorithms for the one-dimensional two-stage cutting stock problem (Q724047) (← links)
- A heuristic approach to one-dimensional cutting stock problem (Q1088890) (← links)
- An exact algorithm for large multiple knapsack problems (Q1124710) (← links)
- A heuristic approach to minimize the number of saw cycles in small-scale furniture factories (Q1686524) (← links)
- One-dimensional cutting stock problem to minimize the number of different patterns (Q1869576) (← links)
- Modeling and solving a real-world cutting stock problem in the marble industry via mathematical programming and stochastic diffusion search approaches (Q2027058) (← links)
- Extensions of dynamic programming for multi-stage combinatorial optimization (Q2205944) (← links)
- The one-dimensional cutting stock problem with usable leftovers -- a survey (Q2356245) (← links)
- One-dimensional stock cutting: optimization of usable leftovers in consecutive orders (Q2401325) (← links)
- An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem (Q2433559) (← links)
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover (Q2803258) (← links)
- Sparse, Continuous Policy Representations for Uniform Online Bin Packing via Regression of Interpolants (Q3304198) (← links)
- An approach to two-dimensional cutting stock problems (Q3753794) (← links)
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic (Q4921221) (← links)
- (Q5398612) (← links)
