Improved flow-based formulations for the skiving stock problem (Q2333124): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: BPPLIB / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2969281395 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Reuse: An Application from Automobile Component Manufacturing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application / 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: Bin packing and related problems: general arc-flow formulation with graph compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Friendly bin packing instances without integer round-up property / 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: An Algorithm for Two-Dimensional Cutting Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem / 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: BPPLIB: a library for bin packing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and Packing Problems with Placement Constraints / 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: Dual Inequalities for Stabilized Column Generation Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting / rank
 
Normal rank
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: Mathematical Methods of Organizing and Planning Production / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large proper gaps in bin packing and dual bin packing problems / 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: An exact algorithm for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arc-flow model for the two-dimensional guillotine cutting stock problem / 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: Integer rounding and modified integer rounding for the skiving stock problem / 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: An upper bound of \(\Delta(E) < 3 \slash 2\) for skiving stock instances of the divisible case / rank
 
Normal rank
Property / cites work
 
Property / cites work: The skiving stock problem and its relation to hypergraph matchings / 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: Q4040221 / 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: Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: The G4-Heuristic for the Pallet Loading Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-Bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution of bin-packing problems using column generation and branch-and-bound / 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: An improved typology of cutting and packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4145427 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The skiving stock problem as a counterpart of the cutting stock problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:38, 20 July 2024

scientific article
Language Label Description Also known as
English
Improved flow-based formulations for the skiving stock problem
scientific article

    Statements

    Improved flow-based formulations for the skiving stock problem (English)
    0 references
    0 references
    11 November 2019
    0 references
    0 references
    cutting and packing
    0 references
    skiving stock problem
    0 references
    arcflow model
    0 references
    integer linear programs
    0 references
    0 references
    0 references
    0 references