Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (Q6157429): Difference between revisions

Revision as of 02:42, 1 August 2024

scientific article; zbMATH DE number 7684706

Language	Label	Description	Also known as
English	Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model	scientific article; zbMATH DE number 7684706

Statements

instance of

scholarly article

0 references

title

Solving the skiving stock problem by a combination of stabilized column generation and the reflect arc-flow model (English)

0 references

0 references

0 references

0 references

0 references

Discrete Applied Mathematics

0 references

publication date

11 May 2023

0 references

zbMATH Keywords

packing

0 references

cutting

0 references

skiving stock problem

0 references

column generation

0 references

flow formulation

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.dam.2023.04.003

0 references

cites work

Cutting and Reuse: An Application from Automobile Component Manufacturing

0 references

On a dual version of the one-dimensional bin packing problem

0 references

A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths

0 references

Dual-Optimal Inequalities for Stabilized Column Generation

0 references

Bin packing and related problems: general arc-flow formulation with graph compression

0 references

Friendly bin packing instances without integer round-up property

0 references

A heuristic for the skiving and cutting stock problem in paper and plastic film industries

0 references

Q3651735

0 references

Arc flow formulations based on dynamic programming: theoretical foundations and applications

0 references

Exact solution of network flow models with strong relaxations

0 references

Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems

0 references

Bin packing and cutting stock problems: mathematical models and exact algorithms

0 references

Column Generation

0 references

Benchmarking optimization software with performance profiles.

0 references

A New Linear Programming Approach to the Cutting Stock Problem

0 references

A Linear Programming Approach to the Cutting-Stock Problem

0 references

A Linear Programming Approach to the Cutting Stock Problem—Part II

0 references

Dual Inequalities for Stabilized Column Generation Revisited

0 references

Stabilized branch-and-price algorithms for vector packing problems

0 references

Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling

0 references

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

0 references

Mathematical Methods of Organizing and Planning Production

0 references

Minimal proper non-IRUP instances of the one-dimensional cutting stock problem

0 references

An exact algorithm for the dual bin packing problem

0 references

Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

0 references

Improved flow-based formulations for the skiving stock problem

0 references

Integer linear programming models for the skiving stock problem

0 references

Integer rounding and modified integer rounding for the skiving stock problem

0 references

The proper relaxation and the proper gap of the skiving stock problem

0 references

Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory

0 references

A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems

0 references

Q4040221

0 references

Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem

0 references

Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem

0 references

A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems

0 references

Exact solution of bin-packing problems using column generation and branch-and-bound

0 references

LP models for bin packing and cutting stock problems

0 references

Using Extra Dual Cuts to Accelerate Column Generation

0 references

Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation

0 references

Q4145427

0 references

The skiving stock problem as a counterpart of the cutting stock problem

0 references

Identifiers

zbMATH Open document ID

1518.90090

0 references

DOI

10.1016/j.dam.2023.04.003

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6157429

@@ Property / cites work @@
+Cutting and Reuse: An Application from Automobile Component Manufacturing
+Normal rank
@@ Property / cites work @@
+On a dual version of the one-dimensional bin packing problem
+Normal rank
@@ Property / cites work @@
+A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
+Normal rank
@@ Property / cites work @@
+Dual-Optimal Inequalities for Stabilized Column Generation
+Normal rank
@@ Property / cites work @@
+Bin packing and related problems: general arc-flow formulation with graph compression
+Normal rank
@@ Property / cites work @@
+Friendly bin packing instances without integer round-up property
+Normal rank
@@ Property / cites work @@
+A heuristic for the skiving and cutting stock problem in paper and plastic film industries
+Normal rank
@@ Property / cites work @@
+Q3651735
@@ Property / cites work: Q3651735 / rank @@
+Normal rank
@@ Property / cites work @@
+Arc flow formulations based on dynamic programming: theoretical foundations and applications
+Normal rank
@@ Property / cites work @@
+Exact solution of network flow models with strong relaxations
+Normal rank
@@ Property / cites work @@
+Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
+Normal rank
@@ Property / cites work @@
+Bin packing and cutting stock problems: mathematical models and exact algorithms
+Normal rank
@@ Property / cites work @@
+Column Generation
@@ Property / cites work: Column Generation / rank @@
+Normal rank
@@ Property / cites work @@
+Benchmarking optimization software with performance profiles.
+Normal rank
@@ Property / cites work @@
+A New Linear Programming Approach to the Cutting Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting-Stock Problem
+Normal rank
@@ Property / cites work @@
+A Linear Programming Approach to the Cutting Stock Problem—Part II
+Normal rank
@@ Property / cites work @@
+Dual Inequalities for Stabilized Column Generation Revisited
+Normal rank
@@ Property / cites work @@
+Stabilized branch-and-price algorithms for vector packing problems
+Normal rank
@@ Property / cites work @@
+Path-Reduced Costs for Eliminating Arcs in Routing and Scheduling
+Normal rank
@@ Property / cites work @@
+Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
+Normal rank
@@ Property / cites work @@
+Mathematical Methods of Organizing and Planning Production
+Normal rank
@@ Property / cites work @@
+Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
+Normal rank
@@ Property / cites work @@
+An exact algorithm for the dual bin packing problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
+Normal rank
@@ Property / cites work @@
+Improved flow-based formulations for the skiving stock problem
+Normal rank
@@ Property / cites work @@
+Integer linear programming models for the skiving stock problem
+Normal rank
@@ Property / cites work @@
+Integer rounding and modified integer rounding for the skiving stock problem
+Normal rank
@@ Property / cites work @@
+The proper relaxation and the proper gap of the skiving stock problem
+Normal rank
@@ Property / cites work @@
+Characterizing IRDP-instances of the skiving stock problem by means of polyhedral theory
+Normal rank
@@ Property / cites work @@
+A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
+Normal rank
@@ Property / cites work @@
+Q4040221
@@ Property / cites work: Q4040221 / rank @@
+Normal rank
@@ Property / cites work @@
+Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
+Normal rank
@@ Property / cites work @@
+Dynamic Programming Algorithms for the Integer Programming Problem—I: The Integer Programming Problem Viewed as a Knapsack Type Problem
+Normal rank
@@ Property / cites work @@
+A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
+Normal rank
@@ Property / cites work @@
+Exact solution of bin-packing problems using column generation and branch-and-bound
+Normal rank
@@ Property / cites work @@
+LP models for bin packing and cutting stock problems
+Normal rank
@@ Property / cites work @@
+Using Extra Dual Cuts to Accelerate Column Generation
+Normal rank
@@ Property / cites work @@
+Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation
+Normal rank
@@ Property / cites work @@
+Q4145427
@@ Property / cites work: Q4145427 / rank @@
+Normal rank
@@ Property / cites work @@
+The skiving stock problem as a counterpart of the cutting stock problem
+Normal rank