Combinatorial complexity of a certain 1-dimensional cutting stock problem
type: Item
instance of: scholarly article
zbMATH Open document ID: 1249.05049
author: V. M. Kartak
author: V. V. Kartak
publication date: 2012-07-26T00:00:00Z
full work available at URL: p57
Mathematics Subject Classification ID: 05B40
zbMATH DE Number: 6059952
zbMATH Keywords: cutting stock problem
zbMATH Keywords: method of branches and boundaries
zbMATH Keywords: integer programming
zbMATH Keywords: combinatorial complexity
MaRDI profile type: Publication
Recommended article: Q3147525
Recommended article: Q3142058
Recommended article: A combined approach to the solution to the general one-dimensional cutting stock problem
Recommended article: Q4448767
Recommended article: A note on the approximability of cutting stock problems
Recommended article: Exact Algorithm for Minimising the Number of Setups in the One-Dimensional Cutting Stock Problem
Recommended article: Q4465129
Recommended article: On the Complexity of a Cutting Plane Algorithm for Solving Combinatorial Linear Programs
Recommended article: Combinatorial properties and the complexity of a max-cut approximation
Recommended article: One-dimensional cutting stock problem to minimize the number of different patterns
title: Combinatorial complexity of a certain 1-dimensional cutting stock problem
published in: Ufimskiĭ Matematicheskiĭ Zhurnal
reviewed by: Svetlana A. Grishina
description: scientific article; zbMATH DE number 6059952