The skiving stock problem and its relation to hypergraph matchings (Q1662646): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper Industry / rank
 
Normal rank
Property / cites work
 
Property / cites work: The skiving stock problem as a counterpart of the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a dual version of the one-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP models for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Programming Approach to the Cutting-Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: A comparative study of the arcflow model and the one-cut model for one-dimensional cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer linear programming models for the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic for the skiving and cutting stock problem in paper and plastic film industries / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Generalized Spectrum Allocation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On-line and off-line approximation algorithms for vector covering problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of algorithms for dual bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital / rank
 
Normal rank
Property / cites work
 
Property / cites work: The proper relaxation and the proper gap of the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer rounding and modified integer rounding for the skiving stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing and cutting stock problems: mathematical models and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal proper non-IRUP instances of the one-dimensional cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tighter relaxations for the cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic graph theory and perfect graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4099676 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4083489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5636932 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum degree and fractional matchings in uniform hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings and covers in hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fractional matching polytope of a hypergraph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Theory and algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The difference and ratio of the fractional matching number and the matching number of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The fractional matching numbers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4165164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589781 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite Fano Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Projective Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5683869 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing Problems and Hypergraph Theory: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP-Based Relaxations of the Skiving Stock Problem—Improved Upper Bounds for the Gap / rank
 
Normal rank

Latest revision as of 10:22, 16 July 2024

scientific article
Language Label Description Also known as
English
The skiving stock problem and its relation to hypergraph matchings
scientific article

    Statements

    The skiving stock problem and its relation to hypergraph matchings (English)
    0 references
    0 references
    0 references
    20 August 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    cutting and packing
    0 references
    skiving stock problem
    0 references
    (fractional) matching
    0 references
    hypergraph
    0 references
    additive integrality gap
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references