A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
type: Item
instance of: scholarly article
title: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
zbMATH Open document ID: 1403.90581
author: J. Martinovic
author: Guntram Scheithauer
author: José Valério de Carvalho
published in: European Journal of Operational Research
publication date: 2018-05-30T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6876567
zbMATH Keywords: cutting and packing
zbMATH Keywords: cutting stock problem
zbMATH Keywords: arcflow model
zbMATH Keywords: one-cut model
describes a project that uses: CUTGEN1
MaRDI profile type: Publication
full work available at URL: j.ejor.2017.10.008
OpenAlex ID: W2766702701
cites work: Accelerating column generation for variable sized bin-packing problems
cites work: A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem
cites work: A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Exact solution of bin-packing problems using column generation and branch-and-bound
cites work: LP models for bin packing and cutting stock problems
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: A New Linear Programming Approach to the Cutting Stock Problem
cites work: Models for the two-dimensional two-stage cutting stock problem with multiple stock size
cites work: CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Optimization of roll cutting in clothing industry
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
cites work: Integer linear programming for a cutting problem in the wood-processing industry: a case study
cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem
cites work: Q3993418
cites work: Integer linear programming models for the skiving stock problem
cites work: The proper relaxation and the proper gap of the skiving stock problem
cites work: The cutting stock problem in a hardboard industry: A case study.
cites work: Q4040221
cites work: Tighter relaxations for the cutting stock problem
cites work: Large gaps in one-dimensional cutting stock problems
cites work: Families of non-IRUP instances of the one-dimensional cutting stock problem
cites work: Cutting and packing optimization. Problems modeling and solution methods.
cites work: The modified integer round-up property of the one-dimensional cutting stock problem
cites work: An integer programming model for two- and three-stage two-dimensional cutting stock problems
cites work: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
cites work: A one-dimensional cutting stock problem in the aluminium industry and its solution
cites work: Branch-and-price algorithms for the one-dimensional cutting stock problem
cites work: An improved typology of cutting and packing problems
cites work: Q4145427
cites work: The skiving stock problem as a counterpart of the cutting stock problem
DOI: 10.1016/J.EJOR.2017.10.008
Recommended article: Arc-flow formulations for the one-dimensional cutting stock problem with multiple manufacturing modes
Recommended article: Arc-flow model for the two-dimensional guillotine cutting stock problem
Recommended article: A new model for complete solutions to one-dimensional cutting stock problems.
Recommended article: Q4827903
Recommended article: Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
Recommended article: A combined approach to the solution to the general one-dimensional cutting stock problem
Recommended article: Near-optimal solutions to one-dimensional cutting stock problems
Recommended article: A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
Recommended article: One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
Recommended article: Q5398612
description: scientific article; zbMATH DE number 6876567