Pages that link to "Item:Q502435"

The following pages link to Packing unequal circles using formulation space search (Q502435):

Displaying 24 items.

• Iterated tabu search and variable neighborhood descent for packing unequal circles into a circular container (Q322528) (← links)
• A formulation space search heuristic for packing unequal circles in a fixed size circular container (Q322624) (← links)
• An action-space-based global optimization algorithm for packing circles into a square container (Q337511) (← links)
• Packing circular-like objects in a rectangular container (Q499146) (← links)
• Quasi-human seniority-order algorithm for unequal circles packing (Q528450) (← links)
• A heuristic for the circle packing problem with a variety of containers (Q635155) (← links)
• Efficiently packing unequal disks in a circle (Q924882) (← links)
• Solving the problem of packing equal and unequal circles in a circular container (Q969742) (← links)
• An efficient quasi-physical quasi-human algorithm for packing equal circles in a circular container (Q1651580) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• Packing unequal rectangles and squares in a fixed size circular container using formulation space search (Q1652609) (← links)
• Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
• An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
• Iterated dynamic thresholding search for packing equal circles into a circular container (Q2077968) (← links)
• A stimulus-response-based allocation method for the circle packing problem with equilibrium constraints (Q2157560) (← links)
• Packing rectangles into a fixed size circular container: constructive and metaheuristic search approaches (Q2184044) (← links)
• Packing a fixed number of identical circles in a circular container with circular prohibited areas (Q2329665) (← links)
• Packing non-identical circles within a rectangle with open length (Q2392114) (← links)
• Packing unequal circles into a strip of minimal length with a jump algorithm (Q2448172) (← links)
• A note on solving MINLP's using formulation space search (Q2448189) (← links)
• New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
• (Q4925974) (← links)
• Greedy algorithms for packing unequal circles into a rectangular container (Q5464427) (← links)