Pages that link to "Item:Q883288"

The following pages link to A new heuristic algorithm for rectangle packing (Q883288):

Displaying 14 items.

• A quasi-human algorithm for the two dimensional rectangular strip packing problem: in memory of Prof. Wenqi Huang (Q306089) (← links)
• A hybrid algorithm based on variable neighbourhood for the strip packing problem (Q306099) (← links)
• An efficient genetic algorithm with a corner space algorithm for a cutting stock problem in the TFT-LCD industry (Q319718) (← links)
• Corner occupying theorem for the two-dimensional integral rectangle packing problem (Q362160) (← links)
• A skyline heuristic for the 2D rectangular packing and strip packing problems (Q421662) (← links)
• Integrated topology optimization with embedded movable holes based on combined description by material density and level sets (Q465865) (← links)
• A hybrid beam search looking-ahead algorithm for the circular packing problem (Q711396) (← links)
• A new heuristic algorithm for cuboids packing with no orientation constraints (Q954042) (← links)
• A least wasted first heuristic algorithm for the rectangular packing problem (Q960413) (← links)
• A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem (Q1651697) (← links)
• An iterative merging algorithm for soft rectangle packing and its extension for application of fixed-outline floorplanning of soft modules (Q1652386) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Optimal packing configuration design with finite-circle method (Q1761240) (← links)
• A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem (Q1761945) (← links)