Integer linear programming models for the skiving stock problem

No abstract is available for this paper.

• Publication year

  2016

• Venue

  European Journal of Operational Research

• Publication date

  2016-06-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1016/j.ejor.2015.11.005
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital

  2013cited by this paper
• A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting

  2006cited by this paper
• Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

  2006cited by this paper
• Using Extra Dual Cuts to Accelerate Column Generation

  2005cited by this paper
• A Hybrid Improvement Heuristic for the One-Dimensional Bin Packing Problem

  2004cited by this paper
• The skiving stock problem as a counterpart of the cutting stock problem

  2003influential reference
• Dual-Optimal Inequalities for Stabilized Column Generation

  2003cited by this paper
• LP models for bin packing and cutting stock problems

  2002cited by this paper
• Exact solution of bin-packing problems using column generation and branch-and-bound

  1999cited by this paper
• Exact solution of cutting stock problems using column generation and branch-and-Bound 1 1 Paper pres

  1998cited by this paper
• Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry

  1997cited by this paper
• An exact algorithm for the dual bin packing problem

  1995cited by this paper
• CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem

  1995cited by this paper
• Probabilistic Analysis of Algorithms for Dual Bin Packing Problems

  1991cited by this paper
• Probabilistic bounds for dual bin-packing

  1985cited by this paper
• On a Dual Version of the One-Dimensional Bin Packing Problem

  1984cited by this paper
• A New Linear Programming Approach to the Cutting Stock Problem

  1981cited by this paper
• Linear Programming and Network Flows

  1977cited by this paper
• Mathematical Methods of Organizing and Planning Production

  1960cited by this paper

• The overflowing bin packing problem: theoretical results and compact ILP formulations

  2026cites this paper
• Dynamic nested column and row generation for the Skiving Stock Problem under uncertain demand

  2025cites this paper
• Tool switching problems with tool order constraints

  2024cites this paper
• Solution approaches for the bi-objective Skiving Stock Problem

  2023cites this paper
• Solving the skiving stock problem by a combination of stabilized column generation and the Reflect Arc-Flow model

  2023cites this paper
• A Two-Phase Pattern Generation and Production Planning Procedure for the Stochastic Skiving Process

  2023influential citation
• Arcflow Formulations and Constraint Generation Frameworks for the Two Bar Charts Packing Problem

  2023cites this paper
• Mathematical models and decomposition methods for the two-bar charts packing problem

  2022cites this paper
• Exact solution of network flow models with strong relaxations

  2021influential citation
• A note on the integrality gap of cutting and skiving stock instances

  2020influential citation
• Improved flow-based formulations for the skiving stock problem

  2020cites this paper
• A new interactive approach for solving fully fuzzy mixed integer linear programming

  2020cites this paper
• Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

  2020cites this paper
• Arc Flow Formulations Based on Dynamic Programming: Theoretical Foundations and Applications

  2020cites this paper
• A note on the integrality gap of cutting and skiving stock instances

  2020cites this paper
• The Effect of Welding on the One-Dimensional Cutting-Stock Problem: The Case of Fixed Firefighting Systems in the Construction Industry

  2019cites this paper
• NEW THEORETICAL INVESTIGATIONS ON THE GAP OF THE SKIVING STOCK PROBLEM

  2019cites this paper
• A heuristic for the skiving and cutting stock problem in paper and plastic film industries

  2019cites this paper
• An Improved Arcflow Model for the Skiving Stock Problem

  2018cites this paper
• Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory

  2018influential citation
• One-Dimensional Cutting Stock

  2018cites this paper
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

  2018cites this paper
• Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case

  2018cites this paper
• Sparsity Prevention Pivoting Method for Linear Programming

  2018cites this paper
• The skiving stock problem and its relation to hypergraph matchings

  2018cites this paper
• A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems

  2018cites this paper
• An upper bound of Δ(E) < 3 / 2 for skiving stock instances of the divisible case

  2017cites this paper
• Integer Linear Programming in Optimization of Waste After Cutting in the Furniture Manufacturing

  2017cites this paper
• Optymalizacja wielokryterialna w procesie produkcji mebli

  2017cites this paper
• Integer Linear Programming Formulations for Cognitive Radio Resource Allocation

  2017cites this paper
• An Improved Upper Bound for the Gap of Skiving Stock Instances of the Divisible Case

  2017cites this paper
• On the Solution of Generalized Spectrum Allocation Problems

  2016cites this paper
• The Skiving Stock Problem and its Application to Cognitive Radio Networks

  2016cites this paper
• Integer rounding and modified integer rounding for the skiving stock problem

  2016cites this paper
• The proper relaxation and the proper gap of the skiving stock problem

  2016cites this paper
• The proper relaxation and the proper gap of the skiving stock problem

  2016cites this paper
• LP-Based Relaxations of the Skiving Stock Problem - Improved Upper Bounds for the Gap

  2015cites this paper
• Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems

  year unknowncites this paper