Improved flow-based formulations for the skiving stock problem

DOI10.1016/J.COR.2019.104770MaRDI QIDQ2333124zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 11 November 2019

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/11380/1186980

zbMATH Keywords

cutting and packinginteger linear programsskiving stock problemarcflow model

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Integer programming (90C10)

Recommendations

• Integer linear programming models for the skiving stock problem
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
• An improved upper bound for the gap of skiving stock instances of the divisible case
• The skiving stock problem as a counterpart of the cutting stock problem

Cites work

• scientific article; zbMATH DE number 193411 (Why is no real title available?)
• scientific article; zbMATH DE number 3573595 (Why is no real title available?)
• A Linear Programming Approach to the Cutting-Stock Problem
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries
• An Algorithm for Two-Dimensional Cutting Problems
• An exact algorithm for the dual bin packing problem
• An improved typology of cutting and packing problems
• An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
• Arc-flow model for the two-dimensional guillotine cutting stock problem
• BPPLIB: a library for bin packing and cutting stock problems
• Bin packing and cutting stock problems: mathematical models and exact algorithms
• Bin packing and related problems: general arc-flow formulation with graph compression
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
• Cutting and Reuse: An Application from Automobile Component Manufacturing
• Cutting and packing problems with placement constraints
• Dual inequalities for stabilized column generation revisited
• Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound
• Exact solution of bin-packing problems using column generation and branch-and-bound
• Friendly bin packing instances without integer round-up property
• Integer linear programming models for the skiving stock problem
• Integer rounding and modified integer rounding for the skiving stock problem
• Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application
• Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
• LP models for bin packing and cutting stock problems
• Large proper gaps in bin packing and dual bin packing problems
• Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
• Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
• On a dual version of the one-dimensional bin packing problem
• Recursive Computational Procedure for Two-dimensional Stock Cutting
• The G4-Heuristic for the Pallet Loading Problem
• The proper relaxation and the proper gap of the skiving stock problem
• The skiving stock problem and its relation to hypergraph matchings
• The skiving stock problem as a counterpart of the cutting stock problem

Cited in

(12)

• Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
• The skiving stock problem as a counterpart of the cutting stock problem
• Integer linear programming models for the skiving stock problem
• A fix‐and‐optimize heuristic for the minmax regret shortest path arborescence problem under interval uncertainty
• Half-cycle: a new formulation for modelling kidney exchange problems
• A combinatorial flow-based formulation for temporal bin packing problems
• Tool switching problems with tool order constraints
• LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
• Arc flow formulations based on dynamic programming: theoretical foundations and applications
• Exact solution of network flow models with strong relaxations
• The proper relaxation and the proper gap of the skiving stock problem

Describes a project that uses

Uses Software

• BPPLIB

This page was built for publication: Improved flow-based formulations for the skiving stock problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2333124)