The trim problem

DOI10.1287/MNSC.3.3.279MaRDI QIDQ2778571zbMATH OpenOpenAlexWikidataFDO

Authors Kurt Eisemann

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

Mathematics Subject Classification ID

Mathematical biology in general (92B99)

Cited in

(26)

• New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
• The cutting stock problem for large sections in the iron and steel industries
• Nesting planning based on production priorities and technological efficiency
• The trim-loss and assortment problems: A survey
• Knowledge based approach to the cutting stock problem
• A real-time one-dimensional cutting stock algorithm for balanced cutting patterns
• An LP-based approach to cutting stock problems with multiple objectives
• 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
• Fully dynamic bin packing revisited
• Better bin packing approximations via discrepancy theory
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Integer linear programming for a cutting problem in the wood-processing industry: a case study
• Relaxation techniques applied to some loading problems
• A Heuristic Solution of a Cutting Problem Using Hypergraphs
• Online strip packing with polynomial migration
• An improved approximation scheme for variable-sized bin packing
• Online bin packing problem with buffer and bounded size revisited
• A robust AFPTAS for online bin packing with polynomial migration
• The entropy rounding method in approximation algorithms
• 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
• Time-sharing scheduling with tolerance capacities
• Mathematical optimisation in the honeycomb cardboard industry: a model for the two-dimensional variable-sized cutting stock problem
• Kantorovich and Zalgaller (1951): the 0-th column generation algorithm

This page was built for publication: The trim problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2778571)