A nonlinear cutting stock problem

MaRDI QIDQ5409067zbMATH OpenFDO

Authors Luiz Leduíno de Salles Neto

Publication date 11 April 2014

zbMATH Keywords

cutting stock problemdiscontinuous costGilmore-Gomory strategyinteger programmingnonlinear programmingnumerical tests

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Production models (90B30) Integer programming (90C10) Nonlinear programming (90C30)

Recommendations

• Nonlinear cutting stock problem model to minimize the number of different patterns and objects
• Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
• Pattern reduction in one-dimensional cutting stock problems
• Solution approaches for the cutting stock problem with setup cost
• A new model for complete solutions to one-dimensional cutting stock problems.

Cited in

(3)

• The cutting stock problem in the canvas industry
• A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock Problems
• Nonlinear cutting stock problem model to minimize the number of different patterns and objects

This page was built for publication: A nonlinear cutting stock problem

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