Solving a two-dimensional trim-loss with MILP

DOI10.1016/S0377-2217(97)00005-2MaRDI QIDQ1291689zbMATH OpenFDO

Authors Johnny Isaksson, Iiro Harjunkoski, Tapio Westerlund

Publication date 22 February 2001

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

Full work available at URL https://doi.org/10.1016/S0377-2217(97)00005-2

zbMATH Keywords

mixed integer linear programmingmixed integer nonlinear programmingoptimizationscheduling problemstrim-loss problems

Mathematics Subject Classification ID

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

Recommendations

• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• Trim loss optimization by an improved differential evolution
• Optimal solutions for the cutting stock problem

Cites work

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

Cited in

(5)

• Different transformations for solving non-convex trim-loss problems by MINLP
• Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm
• An algorithm for the determination of optimal cutting patterns
• An optimization model for trim loss minimization in an automotive glass plant
• Trim loss optimization by an improved differential evolution

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

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