Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (Q5085469): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: TSpack / rank
 
Normal rank
Property / describes a project that uses
 
Property / describes a project that uses: MaxCliqueDyn / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3122681984 / 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: Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Facets of the knapsack polytope / rank
 
Normal rank
Property / cites work
 
Property / cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Conservative scales in packing 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: Constraints in container loading -- a state-of-the-art review / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional finite bin packing problem. II: New lower and upper bounds / 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: New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the two-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensional packing by bilinear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation / 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 survey of dual-feasible and superadditive functions / 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: A new constraint programming approach for the 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: The Meet-in-the-Middle Principle for Cutting and Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Benders' Cuts for the Strip Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Mathematical models and decomposition methods for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems / 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: Logic based Benders' decomposition for orthogonal stock cutting problems / 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: Guided Local Search for the Three-Dimensional Bin-Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for Higher-Dimensional Orthogonal 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: Planning and Scheduling by Logic-Based Benders Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Routing problems with loading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An annotated bibliography of combined routing and loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact solution techniques for two-dimensional cutting and packing / 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: Separation algorithms for 0-1 knapsack polytopes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2837833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: TSpack: A unified tabu search code for multi-dimensional bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3059312 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: Classification and literature review of integrated lot-sizing and cutting stock problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Set-Covering-Based Heuristic Approach for Bin-Packing Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid GRASP/VND algorithm for two- and three-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional 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: A theoretical and experimental study of fast lower bounds for the two-dimensional bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The load-balanced multi-dimensional bin-packing problem / 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: A goal-driven approach to the 2D bin packing and variable-sized bin packing problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faces for a linear inequality in 0–1 variables / rank
 
Normal rank

Latest revision as of 11:56, 29 July 2024

scientific article; zbMATH DE number 7548820
Language Label Description Also known as
English
Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem
scientific article; zbMATH DE number 7548820

    Statements

    Combinatorial Benders Decomposition for the Two-Dimensional Bin Packing Problem (English)
    0 references
    0 references
    0 references
    0 references
    27 June 2022
    0 references
    0 references
    two-dimensional bin packing problem
    0 references
    exact algorithm
    0 references
    Benders decomposition
    0 references
    combinatorial Benders cut
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references