Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
From MaRDI portal
Recommendations
- Coordinate descent heuristics for the irregular strip packing problem of rasterized shapes
- Mapping rectangular mesh algorithms onto asymptotically space-optimal arrays
- Heuristic approaches to large-scale periodic packing of irregular shapes on a rectangular sheet
- Grid scheduling by on-line rectangle packing
- Efficient local search heuristics for packing irregular shapes in two-dimensional heterogeneous bins
- Generalized hyper-heuristics for solving 2D regular and irregular packing problems
- Embedding of Grids into Optimal Hypercubes
- Grids for cutting and packing problems: a study in the 2D knapsack problem
- Hybrid Voronoi mesh generation: algorithms and unsolved problems
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem
This page was built for publication: Meshlization of Irregular Grid Resource Topologies by Heuristic Square-Packing Methods
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3061058)