The Trim Problem
From MaRDI portal
Publication:2778571
DOI10.1287/mnsc.3.3.279zbMath0995.92500OpenAlexW2060453713WikidataQ96290014 ScholiaQ96290014MaRDI QIDQ2778571
Publication date: 17 October 2002
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.3.3.279
Related Items (23)
Bin packing and cutting stock problems: mathematical models and exact algorithms ⋮ Nesting planning based on production priorities and technological efficiency ⋮ An iterated greedy algorithm for the planning of yarn‐dyeing boilers ⋮ A Faster Exponential Time Algorithm for Bin Packing With a Constant Number of Bins via Additive Combinatorics ⋮ Resource time-sharing for IoT applications with deadlines ⋮ The trim-loss and assortment problems: A survey ⋮ Unnamed Item ⋮ Relaxation techniques applied to some loading problems ⋮ A simple \(OPT+1\) algorithm for cutting stock under the modified integer round-up property assumption ⋮ An exact model for a slitting problem in the steel industry ⋮ An improved approximation scheme for variable-sized bin packing ⋮ Online bin packing problem with buffer and bounded size revisited ⋮ Knowledge based approach to the cutting stock problem ⋮ A Heuristic Solution of a Cutting Problem Using Hypergraphs ⋮ Fully dynamic bin packing revisited ⋮ Better Bin Packing Approximations via Discrepancy Theory ⋮ Integer linear programming for a cutting problem in the wood-processing industry: a case study ⋮ An LP-based approach to cutting stock problems with multiple objectives ⋮ A Robust AFPTAS for Online Bin Packing with Polynomial Migration ⋮ New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems ⋮ Unnamed Item ⋮ The cutting stock problem for large sections in the iron and steel industries ⋮ A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
This page was built for publication: The Trim Problem
