An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
From MaRDI portal
Publication:2030652
DOI10.1016/j.ejor.2020.10.050zbMath1487.90561arXiv2004.00963OpenAlexW3094979732MaRDI QIDQ2030652
Luc Libralesso, Florian Fontan
Publication date: 7 June 2021
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2004.00963
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Discrete location and assignment (90B80) Approximation algorithms (68W25)
Related Items
Iterative beam search algorithms for the permutation flowshop ⋮ A beam search algorithm for minimizing crane times in premarshalling problems ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ Exact and anytime approach for solving the time dependent traveling salesman problem with time windows ⋮ A lookahead matheuristic for the unweighed variable-sized two-dimensional bin packing problem
Uses Software
Cites Work
- Unnamed Item
- A hybrid heuristic algorithm for the 2D variable-sized bin packing problem
- A block-based layer building approach for the 2D guillotine strip packing problem
- Heuristics for the strip packing problem with unloading constraints
- Heuristic for the rectangular strip packing problem with rotation of items
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- Branch-and-price and beam search algorithms for the variable cost and size bin packing problem with optional items
- Solving the circular open dimension problem by using separate beams and look-ahead strategies
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts
- A tree search algorithm for solving the multi-dimensional strip packing problem with guillotine cutting constraint
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem
- A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
- A goal-driven approach to the 2D bin packing and variable-sized bin packing problems
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- An open space based heuristic for the 2D strip packing problem with unloading constraints
- Two-dimensional strip packing with unloading constraints
- The two-dimensional bin packing problem with variable bin sizes and costs
- Models and algorithms for three-stage two-dimensional bin packing
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Two Dimensional Strip Packing with Unloading Constraints
- Two Dimensional Knapsack with Unloading Constraints
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Guillotine cutting of defective boards
