A beam search approach to solve the convex irregular bin packing problem with guillotine guts
From MaRDI portal
Publication:1754728
Recommendations
- A beam search implementation for the irregular shape packing problem
- Beam search and non-linear programming tools for the circular packing problem
- A beam search algorithm for the circular packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- A hybrid beam search looking-ahead algorithm for the circular packing problem
- A beam search approach to the container loading problem
- Multi-dimensional bin packing problems with guillotine constraints
- Heuristic search algorithm for the rectangular fixed-size guillotine bin packing problem
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
Cites work
- A beam search algorithm for the circular packing problem
- A beam search implementation for the irregular shape packing problem
- A clique covering MIP model for the irregular strip packing problem
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- A new algorithm for the minimal-area convex enclosure problem
- A tutorial in irregular shape packing problems
- An improved typology of cutting and packing problems
- Approximation algorithm for the oriented two-dimensional bin packing problem
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Job shop scheduling with beam search
- Makespan minimization for scheduling unrelated parallel machines: a recovering beam search approach
- Matheuristics for the irregular bin packing problem with free rotations
- Models and algorithms for three-stage two-dimensional bin packing
- Multistage Cutting Stock Problems of Two and More Dimensions
- Partial enumeration algorithms for two-dimensional bin packing problem with guillotine constraints
- Robust mixed-integer linear programming models for the irregular strip packing problem
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
Cited in
(15)- Orientational variable-length strip covering problem: a branch-and-price-based algorithm
- An anytime tree search algorithm for the 2018 ROADEF/EURO challenge glass cutting problem
- Solving a large cutting problem in the glass manufacturing industry
- Irregular packing problems: a review of mathematical models
- Construction heuristics for two-dimensional irregular shape bin packing with guillotine constraints
- An iteratively doubling local search for the two-dimensional irregular bin packing problem with limited rotations
- Exact and approximate methods for the score-constrained packing problem
- A branch‐and‐cut algorithm for the irregular strip packing problem with uncertain demands
- Heuristics for the two-dimensional irregular bin packing problem with limited rotations
- Solving two-dimensional cutting stock problem via a DNA computing algorithm
- An iteratively doubling binary search for the two-dimensional irregular multiple-size bin packing problem raised in the steel industry
- Two-dimensional bin packing, cutting stock, and open dimension problems: a survey of practical requirements
- A branch-and-cut algorithm for nesting problems with guillotine constraints
- Beam search and non-linear programming tools for the circular packing problem
- A beam search implementation for the irregular shape packing problem
This page was built for publication: A beam search approach to solve the convex irregular bin packing problem with guillotine guts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1754728)
