An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
type: Item
instance of: scholarly article
title: An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
zbMATH Open document ID: 1376.90020
author: J. Martinovic
author: Guntram Scheithauer
published in: Discrete Applied Mathematics
publication date: 2017-07-27T00:00:00Z
Mathematics Subject Classification ID: 90B30
Mathematics Subject Classification ID: 65K10
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 6754402
zbMATH Keywords: cutting and packing
zbMATH Keywords: skiving stock problem
zbMATH Keywords: divisible case
zbMATH Keywords: (modified) integer round-down property
zbMATH Keywords: gap
MaRDI profile type: Publication
full work available at URL: j.dam.2017.05.015
OpenAlex ID: W2666990287
cites work: On a dual version of the one-dimensional bin packing problem
cites work: Windows scheduling as a restricted version of bin packing
cites work: Integer Rounding for Polymatroid and Branching Optimization Problems
cites work: Probabilistic bounds for dual bin-packing
cites work: Friendly bin packing instances without integer round-up property
cites work: Bin packing with divisible item sizes
cites work: Probabilistic analysis of algorithms for dual bin packing problems
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Logarithmic Additive Integrality Gap for Bin Packing
cites work: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
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: An exact algorithm for the dual bin packing problem
cites work: An instance of the cutting stock problem for which the rounding property does not hold
cites work: The proper relaxation and the proper gap of the skiving stock problem
cites work: Integer linear programming models for the skiving stock problem
cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing 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: LP models for bin packing and cutting stock problems
cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
cites work: An improved typology of cutting and packing problems
cites work: The skiving stock problem as a counterpart of the cutting stock problem
DOI: 10.1016/J.DAM.2017.05.015
description: scientific article; zbMATH DE number 6754402