A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Import241208061232 (talk | contribs)
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ejor.2018.04.014 / rank
Normal rank
 
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.014 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2800796761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tabu search algorithm for a two-dimensional non-guillotine cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem / 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: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure / rank
 
Normal rank
Property / cites work
 
Property / cites work: A population heuristic for constrained two-dimensional non-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: A note on an <i>L</i>-approach for solving the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces / 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: On the two-dimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation / 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: Heuristic approaches for the two- and three-dimensional knapsack packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems / 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: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive exact algorithm for weighted two-dimensional cutting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new heuristic algorithm for rectangle packing / 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: Exhaustive approaches to 2D rectangular perfect packings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>L</i>-approach for packing (<i>ℓ</i>, <i>w</i>)-rectangles into rectangular and <i>L</i>-shaped pieces / 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: The Three-Dimensional Bin Packing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An and-or-graph approach for two-dimensional cutting problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective tabu search approach with improved loading algorithms for the 3L-CVRP / 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 bidirectional building approach for the 2D constrained guillotine knapsack packing problem / 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 / cites work
 
Property / cites work: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A least wasted first heuristic algorithm for the rectangular packing problem / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q129956574 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.EJOR.2018.04.014 / rank
 
Normal rank

Latest revision as of 01:03, 11 December 2024

scientific article
Language Label Description Also known as
English
A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
scientific article

    Statements

    A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    12 July 2018
    0 references
    packing
    0 references
    cutting
    0 references
    branch and bound
    0 references
    non-guillotine
    0 references
    best-fit
    0 references

    Identifiers