The skiving stock problem and its relation to hypergraph matchings
type: Item
instance of: scholarly article
title: The skiving stock problem and its relation to hypergraph matchings
zbMATH Open document ID: 1506.90228
author: J. Martinovic
author: Guntram Scheithauer
published in: Discrete Optimization
publication date: 2018-08-20T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6920584
zbMATH Keywords: cutting and packing
zbMATH Keywords: skiving stock problem
zbMATH Keywords: (fractional) matching
zbMATH Keywords: hypergraph
zbMATH Keywords: additive integrality gap
MaRDI profile type: Publication
full work available at URL: j.disopt.2018.03.001
OpenAlex ID: W2793916479
cites work: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry
cites work: The skiving stock problem as a counterpart of the cutting stock problem
cites work: On a dual version of the one-dimensional bin packing problem
cites work: An exact algorithm for the dual bin packing problem
cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
cites work: An improved typology of cutting and packing problems
cites work: LP models for bin packing and cutting stock problems
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
cites work: Integer linear programming models for the skiving stock problem
cites work: A heuristic for the skiving and cutting stock problem in paper and plastic film industries
cites work: On the Solution of Generalized Spectrum Allocation Problems
cites work: On-line and off-line approximation algorithms for vector covering problems
cites work: Probabilistic analysis of algorithms for dual bin packing problems
cites work: Probabilistic bounds for dual bin-packing
cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
cites work: The proper relaxation and the proper gap of the skiving stock problem
cites work: Integer rounding and modified integer rounding for the skiving stock problem
cites work: Q4145427
cites work: Bin packing and related problems: general arc-flow formulation with graph compression
cites work: Q4040221
cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms
cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
cites work: Tighter relaxations for the cutting stock problem
cites work: Q5422499
cites work: Algorithmic graph theory and perfect graphs
cites work: Matching theory
cites work: Q4099676
cites work: Q4083489
cites work: Q5636932
cites work: Maximum degree and fractional matchings in uniform hypergraphs
cites work: Matchings and covers in hypergraphs
cites work: On the fractional matching polytope of a hypergraph
cites work: Q3993087
cites work: Combinatorial optimization. Theory and algorithms.
cites work: The difference and ratio of the fractional matching number and the matching number of graphs
cites work: The fractional matching numbers of graphs
cites work: Q4165164
cites work: Q5589781
cites work: Finite Fano Planes
cites work: Projective Planes
cites work: Q5683869
cites work: Packing Problems and Hypergraph Theory: A Survey
cites work: LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
Wikidata QID: Q130097142
DOI: 10.1016/J.DISOPT.2018.03.001
description: scientific article; zbMATH DE number 6920584