The skiving stock problem and its relation to hypergraph matchings
From MaRDI portal
Publication:1662646
DOI10.1016/J.DISOPT.2018.03.001zbMATH Open1506.90228OpenAlexW2793916479WikidataQ130097142 ScholiaQ130097142MaRDI QIDQ1662646FDOQ1662646
Authors: J. Martinovic, Guntram Scheithauer 
Publication date: 20 August 2018
Published in: Discrete Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disopt.2018.03.001
Recommendations
- The proper relaxation and the proper gap of the skiving stock problem
- The skiving stock problem as a counterpart of the cutting stock problem
- An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case
Cites Work
- Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
- Graph theory
- A Linear Programming Approach to the Cutting-Stock Problem
- Matching theory
- An improved typology of cutting and packing problems
- On a dual version of the one-dimensional bin packing problem
- Title not available (Why is that?)
- Algorithmic graph theory and perfect graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- LP models for bin packing and cutting stock problems
- Title not available (Why is that?)
- Matchings and covers in hypergraphs
- Title not available (Why is that?)
- Projective Planes
- On-line and off-line approximation algorithms for vector covering problems
- A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital
- Probabilistic analysis of algorithms for dual bin packing problems
- Title not available (Why is that?)
- Probabilistic bounds for dual bin-packing
- Integer rounding and modified integer rounding for the skiving stock problem
- Tighter relaxations for the cutting stock problem
- An exact algorithm for the dual bin packing problem
- Minimal proper non-IRUP instances of the one-dimensional cutting stock problem
- Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
- Integer linear programming models for the skiving stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Bin packing and related problems: general arc-flow formulation with graph compression
- Title not available (Why is that?)
- 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
- Combinatorial optimization. Theory and algorithms.
- Maximum degree and fractional matchings in uniform hypergraphs
- Finite Fano Planes
- LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap
- The proper relaxation and the proper gap of the skiving stock problem
- The fractional matching numbers of graphs
- Packing Problems and Hypergraph Theory: A Survey
- On the fractional matching polytope of a hypergraph
- The difference and ratio of the fractional matching number and the matching number of graphs
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- On the Solution of Generalized Spectrum Allocation Problems
- A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems
- Title not available (Why is that?)
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
Cited In (2)
This page was built for publication: The skiving stock problem and its relation to hypergraph matchings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662646)
