Integer rounding and modified integer rounding for the skiving stock problem
type: Item
instance of: scholarly article
title: Integer rounding and modified integer rounding for the skiving stock problem
zbMATH Open document ID: 1387.90144
author: J. Martinovic
author: Guntram Scheithauer
published in: Discrete Optimization
publication date: 2018-05-24T00:00:00Z
Mathematics Subject Classification ID: 90C10
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B50
zbMATH DE Number: 6872091
zbMATH Keywords: cutting and packing
zbMATH Keywords: skiving stock problem
zbMATH Keywords: (modified) integer round down property
zbMATH Keywords: gap
zbMATH Keywords: continuous relaxation
MaRDI profile type: Publication
full work available at URL: j.disopt.2016.06.004
OpenAlex ID: W2476175584
cites work: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
cites work: The skiving stock problem as a counterpart of the cutting stock problem
cites work: On a dual version of the one-dimensional bin packing problem
cites work: An exact algorithm for the dual bin packing problem
cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
cites work: Probabilistic analysis of algorithms for dual bin packing problems
cites work: Probabilistic bounds for dual bin-packing
cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Integer linear programming models for the skiving stock problem
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: On the bin packing problem with a fixed number of object weights
cites work: Bin Packing via Discrepancy of Permutations
cites work: A Logarithmic Additive Integrality Gap for Bin Packing
cites work: Column generation for linear and integer programming
cites work: Cutting and packing optimization. Problems modeling and solution methods.
cites work: Families of non-IRUP instances of the one-dimensional cutting stock problem
cites work: Tighter relaxations for the cutting stock problem
cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
DOI: 10.1016/J.DISOPT.2016.06.004
description: scientific article; zbMATH DE number 6872091