The following pages link to The Trim Problem (Q2778571):
Displaying 22 items.
- Bin packing and cutting stock problems: mathematical models and exact algorithms (Q323473) (← links)
- An improved approximation scheme for variable-sized bin packing (Q504994) (← links)
- Online bin packing problem with buffer and bounded size revisited (Q511697) (← links)
- New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems (Q1046097) (← links)
- The cutting stock problem for large sections in the iron and steel industries (Q1062609) (← links)
- Nesting planning based on production priorities and technological efficiency (Q1129962) (← links)
- The trim-loss and assortment problems: A survey (Q1143942) (← links)
- Knowledge based approach to the cutting stock problem (Q1197096) (← links)
- A real-time one-dimensional cutting stock algorithm for balanced cutting patterns (Q1318665) (← links)
- An LP-based approach to cutting stock problems with multiple objectives (Q1825766) (← links)
- A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption (Q1944927) (← links)
- An exact model for a slitting problem in the steel industry (Q2239876) (← links)
- Fully dynamic bin packing revisited (Q2288188) (← links)
- Better Bin Packing Approximations via Discrepancy Theory (Q2816297) (← links)
- Integer linear programming for a cutting problem in the wood-processing industry: a case study (Q3401328) (← links)
- Relaxation techniques applied to some loading problems (Q4327925) (← links)
- A Heuristic Solution of a Cutting Problem Using Hypergraphs (Q4915264) (← links)
- (Q5002616) (← links)
- A Robust AFPTAS for Online Bin Packing with Polynomial Migration (Q5241236) (← links)
- (Q5743405) (← links)
- An iterated greedy algorithm for the planning of yarn‐dyeing boilers (Q6060692) (← links)
- A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics (Q6089980) (← links)
