A two-objective mathematical model without cutting patterns for one-dimensional assortment problems

DOI10.1016/J.CAM.2010.07.019MaRDI QIDQ555147zbMATH OpenOpenAlexFDO

Authors Nergiz Kasimbeyli, Refail Kasimbeyli, Tugba Saraç

Publication date 22 July 2011

Published in Journal of Computational and Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cam.2010.07.019

zbMATH Keywords

multi-objective optimizationheuristic algorithmcutting stock problemone-dimensional assortment problemstock size selectiontrim loss minimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Mixed integer programming (90C11) Discrete location and assignment (90B80)

Recommendations

• A multi-objective programming approach to 1.5-dimensional assortment problem
• The generalized assortment and best cutting stock length problems
• scientific article; zbMATH DE number 2043380
• A new model for complete solutions to one-dimensional cutting stock problems.
• An algorithm for the two-dimensional assortment problem

Cites work

• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
• A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
• A multi-objective programming approach to 1.5-dimensional assortment problem
• A typology of cutting and packing problems
• An improved typology of cutting and packing problems
• Cutting optimization with variable-sized stock and inventory status data
• Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
• Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
• The trim-loss and assortment problems: A survey

Cited in

(6)

• Multiobjective mathematical models and solution approaches for heterogeneous fixed fleet vehicle routing problems
• scientific article; zbMATH DE number 2043380 (Why is no real title available?)
• A cutting stock problem in the wood products industry: a two‐stage solution approach
• A multi-objective programming approach to 1.5-dimensional assortment problem
• Determining the best shipper sizes for sending products to customers
• A coradiant based scalarization to characterize approximate solutions of vector optimization problems with variable ordering structures

This page was built for publication: A two-objective mathematical model without cutting patterns for one-dimensional assortment problems

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