Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry - MaRDI portal

Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry

From MaRDI portal
Publication:4376208

DOI10.1137/S003614459531004XzbMath0891.90115MaRDI QIDQ4376208

No author found.

Publication date: 10 February 1998

Published in: SIAM Review (Search for Journal in Brave)




Related Items (20)

Reel and sheet cutting at a paper millInteger linear programming models for the skiving stock problemThe skiving stock problem as a counterpart of the cutting stock problemOne-dimensional cutting stock optimization in consecutive time periodsThe skiving stock problem and its relation to hypergraph matchingsTwo-dimensional skiving and cutting stock problem with setup cost based on column-and-row generationA heuristic for the skiving and cutting stock problem in paper and plastic film industriesSolving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow modelCombinatorial investigations on the maximum gap for skiving stock instances of the divisible caseThe proper relaxation and the proper gap of the skiving stock problemCharacterizing IRDP-instances of the skiving stock problem by means of polyhedral theoryInteger rounding and modified integer rounding for the skiving stock problemAn upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible caseIntegrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its applicationAn Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible CaseModified greedy heuristic for the one-dimensional cutting stock problemImproved flow-based formulations for the skiving stock problemBranch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problemModeling multistage cutting stock problemsRow and column generation technique for a multistage cutting stock problem




This page was built for publication: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry