Pages that link to "Item:Q964846"
From MaRDI portal
The following pages link to A beam search implementation for the irregular shape packing problem (Q964846):
Displaying 14 items.
- Irregular packing: MILP model based on a polygonal enclosure (Q256688) (← links)
- An effective heuristic for the two-dimensional irregular bin packing problem (Q363571) (← links)
- Algorithms for nesting with defects (Q406491) (← links)
- A clique covering MIP model for the irregular strip packing problem (Q1652422) (← links)
- Dealing with nonregular shapes packing (Q1718651) (← links)
- Matheuristics for the irregular bin packing problem with free rotations (Q1751657) (← links)
- A beam search approach to solve the convex irregular bin packing problem with guillotine guts (Q1754728) (← links)
- A parallel biased random-key genetic algorithm with multiple populations applied to irregular strip packing problems (Q1992380) (← links)
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes (Q2160486) (← links)
- Solving a large cutting problem in the glass manufacturing industry (Q2189955) (← links)
- Irreducible bin packing and normality in routing open shop (Q2240719) (← links)
- Raster penetration map applied to the irregular packing problem (Q2312355) (← links)
- An improved best-fit heuristic for the orthogonal strip packing problem (Q2862160) (← links)
- A fast implementation for the 2D/3D box placement problem (Q5963685) (← links)
