Algorithms for the one-dimensional two-stage cutting stock problem
type: Item
instance of: scholarly article
title: Algorithms for the one-dimensional two-stage cutting stock problem
zbMATH Open document ID: 1403.90583
author: Zeynep Sezer
author: İbrahim Muter
published in: European Journal of Operational Research
publication date: 2018-07-25T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6910081
zbMATH Keywords: cutting
zbMATH Keywords: two-stage cutting stock problem
zbMATH Keywords: column-and-row generation
zbMATH Keywords: problems with column-dependent-rows
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.042
OpenAlex ID: W2800285872
cites work: A LP-based heuristic for a time-constrained routing problem
cites work: Computational study of large-scale \(p\)-median problems
cites work: Branch-and-price: Column generation for solving huge integer programs
cites work: Q4079613
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: A typology of cutting and packing problems
cites work: A two-phase roll cutting problem
cites work: 0-1 reformulations of the multicommodity capacitated network design problem
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: A Heuristic Programming Solution to a Nonlinear Cutting Stock Problem
cites work: Computing Partitions with Applications to the Knapsack Problem
cites work: The one dimensional Compartmentalised Knapsack problem: a case study
cites work: Shortest Path Problems with Resource Constraints
cites work: Bounds for nested knapsack problems
cites work: A capacity scaling heuristic for the multicommodity capacitated network design problem
cites work: The constrained compartmentalized knapsack problem: mathematical models and solution methods
cites work: Selected Topics in Column Generation
cites work: A Decomposition-Based Pricing Procedure for Large-Scale Linear Programs: An Application to the Linear Multicommodity Flow Problem
cites work: The constrained compartmentalised knapsack problem
cites work: Q3993418
cites work: A note on ``A LP-based heuristic for a time-constrained routing problem''
cites work: Simultaneous column-and-row generation for large-scale linear programs with column-dependent-rows
cites work: LP models for bin packing and cutting stock problems
cites work: An LP-based approach to a two-stage cutting stock problem
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
cites work: An improved typology of cutting and packing problems
cites work: The knapsack problem with a minimum filling constraint
cites work: Modeling multistage cutting stock problems
cites work: Row and column generation technique for a multistage cutting stock problem
Wikidata QID: Q129915245
DOI: 10.1016/J.EJOR.2018.04.042
Recommended article: Efficient algorithm for the constrained two-dimensional cutting stock problem
Recommended article: Algorithms for the constrained two-staged two-dimensional cutting problem
Recommended article: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
Recommended article: Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
Recommended article: Q3589039
Recommended article: Q4848284
Recommended article: The One Dimensional Cutting Stock Problem Using Two Objectives
Recommended article: Branch-and-price algorithms for the one-dimensional cutting stock problem
Recommended article: An algorithm for the 2D guillotine cutting stock problem
Recommended article: Near-optimal solutions to one-dimensional cutting stock problems
description: scientific article; zbMATH DE number 6910081