An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (Q2030652): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving the circular open dimension problem by using separate beams and look-ahead strategies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-stage two-dimensional guillotine cutting stock problems with usable leftover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items / 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: A beam search approach to solve the convex irregular bin packing problem with guillotine guts / rank
 
Normal rank
Property / cites work
 
Property / cites work: A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint / 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: Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic for the rectangular strip packing problem with rotation of items / rank
 
Normal rank
Property / cites work
 
Property / cites work: A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects / rank
 
Normal rank
Property / cites work
 
Property / cites work: A hybrid heuristic algorithm for the 2D variable-sized bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The two-dimensional bin packing problem with variable bin sizes and costs / 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: Models and algorithms for three-stage two-dimensional bin packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4843187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Guillotine cutting of defective boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the strip packing problem with unloading constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Knapsack with Unloading Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two Dimensional Strip Packing with Unloading Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-dimensional strip packing with unloading constraints / 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: A block-based layer building approach for the 2D guillotine strip packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An open space based heuristic for the 2D strip packing problem with unloading constraints / rank
 
Normal rank

Latest revision as of 21:50, 25 July 2024

scientific article
Language Label Description Also known as
English
An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
scientific article

    Statements

    An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem (English)
    0 references
    0 references
    0 references
    7 June 2021
    0 references
    anytime tree search
    0 references
    cutting \& packing
    0 references
    2018 ROADEF/EURO challenge
    0 references
    Iterative Memory Bounded A*
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references