Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie

DOI10.1007/BF01782759zbMath0493.90044MaRDI QIDQ1168886

T. Laubenstein, H.-J. Vaterrodt, Christoph A. Schneeweiß

Publication date: 1982

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

sequencingcutting stocksolution procedurewaste minimizationoptimal cutting pattern

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10) Deterministic scheduling theory in operations research (90B35)

Cites Work

• Unnamed Item
• Approximate Traveling Salesman Algorithms
• Some Simple Applications of the Travelling Salesman Problem
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem

This page was built for publication: Verschnittoptimierung im praktischen Einsatz. Eine Fallstudie