Solving a two-dimensional trim-loss with MILP

DOI10.1016/S0377-2217(97)00005-2zbMath0955.90028MaRDI QIDQ1291689

Iiro Harjunkoski, Johnny Isaksson, Tapio Westerlund

Publication date: 22 February 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

zbMATH Keywords

optimizationscheduling problemsmixed integer linear programmingmixed integer nonlinear programmingtrim-loss problems

Mathematics Subject Classification ID

Mixed integer programming (90C11) Deterministic scheduling theory in operations research (90B35)

Related Items (1)

An algorithm for the determination of optimal cutting patterns

Cites Work

• The trim-loss and assortment problems: A survey
• An LP-based approach to cutting stock problems with multiple objectives
• An Automatic Method of Solving Discrete Programming Problems
• A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem

This page was built for publication: Solving a two-dimensional trim-loss with MILP