Combinatorial Benders' Cuts for the Strip Packing Problem (Q2935306): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Created claim: Wikidata QID (P12): Q59222237, #quickstatements; #temporary_batch_1723853789000
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Knapsack / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1969327924 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reactive GRASP for the strip-packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A branch and bound algorithm for the strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact strip packing algorithm based on canonical forms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strip packing with precedence constraints and strip packing with release times / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partitioning procedures for solving mixed-variables programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Dimensional Finite Bin-Packing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Dimensional Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A squeaky wheel optimisation methodology for two-dimensional strip packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional packing by bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scheduling inspired models for two-dimensional packing problems / 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: A new exact method for the two-dimensional orthogonal packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for Mixed-Integer Linear Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Benders decomposition / 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: Multistage Cutting Stock Problems of Two and More Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A SAT Encoding for Multi-dimensional Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A (5/3 + ε)-Approximation for Strip Packing / 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: Q4523706 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logic-based Benders decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rectangle packing with one-dimensional resource augmentation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Near-Optimal Solution to a Two-Dimensional Cutting Stock Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exhaustive approaches to 2D rectangular perfect packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Solution of the Two-Dimensional Finite Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Approach to the Strip-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3005898 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q59222237 / rank
 
Normal rank

Latest revision as of 02:38, 17 August 2024

scientific article
Language Label Description Also known as
English
Combinatorial Benders' Cuts for the Strip Packing Problem
scientific article

    Statements

    Combinatorial Benders' Cuts for the Strip Packing Problem (English)
    0 references
    0 references
    0 references
    0 references
    22 December 2014
    0 references
    strip packing problem
    0 references
    exact algorithm
    0 references
    Benders' decomposition
    0 references
    combinatorial Benders' cut
    0 references
    0 references
    0 references

    Identifiers