A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
type: Item
instance of: scholarly article
title: A two-objective mathematical model without cutting patterns for one-dimensional assortment problems
zbMATH Open document ID: 1430.90380
author: Nergiz Kasimbeyli
author: Refail Kasimbeyli
author: Tugba Saraç
published in: Journal of Computational and Applied Mathematics
publication date: 2011-07-22T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C29
zbMATH DE Number: 5930989
zbMATH Keywords: one-dimensional assortment problem
zbMATH Keywords: cutting stock problem
zbMATH Keywords: stock size selection
zbMATH Keywords: trim loss minimization
zbMATH Keywords: heuristic algorithm
zbMATH Keywords: multi-objective optimization
MaRDI profile type: Publication
full work available at URL: j.cam.2010.07.019
OpenAlex ID: W2044840830
cites work: A typology of cutting and packing problems
cites work: An improved typology of cutting and packing problems
cites work: The trim-loss and assortment problems: A survey
cites work: Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
cites work: A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Cutting optimization with variable-sized stock and inventory status data
cites work: Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
cites work: A multi-objective programming approach to 1.5-dimensional assortment problem
DOI: 10.1016/J.CAM.2010.07.019
description: scientific article; zbMATH DE number 5930989