Pages that link to "Item:Q1778980"
From MaRDI portal
The following pages link to The rectangular packing problem: local optimum search methods based on block structures (Q1778980):
Displaying 14 items.
- Efficient implementations of construction heuristics for the rectilinear block packing problem (Q337284) (← links)
- A heuristic approach for packing identical rectangles in convex regions (Q632680) (← links)
- Packing of one-dimensional bins with contiguous selection of identical items: an exact method of optimal solution (Q664176) (← links)
- A simulated annealing based hyperheuristic for determining shipper sizes for storage and transportation (Q863991) (← links)
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation (Q930939) (← links)
- Design of rectangular packings: Block structure-based reconstruction algorithm (Q1002876) (← links)
- Local search of orthogonal packings using the lower bounds (Q1040483) (← links)
- Local search algorithms for the rectangle packing problem with general spatial costs (Q1403304) (← links)
- Design of rectangular packings using decoders of block structure (Q2457589) (← links)
- Improved local search algorithms for the rectangle packing problem with general spatial costs (Q2484340) (← links)
- An efficient heuristic algorithm for arbitrary shaped rectilinear block packing problem (Q2654397) (← links)
- A finite method of searching for the global minimum of the rectangular packing problem (Q2896524) (← links)
- A Local Optimization-based Solution to the Rectangle Layout Problem (Q4717142) (← links)
- Global optimization for the three-dimensional open-dimension rectangular packing problem (Q5058800) (← links)
