Pages that link to "Item:Q1333536"

The following pages link to Integrated container loading software for pulp and paper industry (Q1333536):

Displaying 31 items.

• High density packings of equal circles in rectangles with variable aspect ratio (Q339540) (← links)
• Packing circular-like objects in a rectangular container (Q499146) (← links)
• Parallel greedy algorithms for packing unequal circles into a strip or a rectangle (Q623818) (← links)
• Solving circle packing problems by global optimization: numerical results and industrial applications (Q932199) (← links)
• Column enumeration based decomposition techniques for a class of non-convex MINLP problems (Q1029695) (← links)
• Cutting circles and polygons from area-minimizing rectangles (Q1029696) (← links)
• Packing different-sized circles into a rectangular container (Q1127229) (← links)
• Approximate algorithms for constrained circular cutting problems (Q1433164) (← links)
• An efficient approach for the multi-pallet loading problem (Q1569940) (← links)
• A memetic algorithm to pack unequal circles into a square (Q1651582) (← links)
• Integer programming formulations for approximate packing circles in a rectangular container (Q1718120) (← links)
• Split packing: algorithms for packing circles with optimal worst-case density (Q1731458) (← links)
• An improved algorithm for the packing of unequal circles within a larger containing circle (Q1847187) (← links)
• A simulated annealing approach for the circular cutting problem (Q1876197) (← links)
• Optimizing the packing of cylinders into a rectangular container: A nonlinear approach (Q1887860) (← links)
• Efficient approaches for furnace loading of cylindrical parts (Q1994472) (← links)
• Minimizing late deliveries in a truck loading problem (Q2189887) (← links)
• Convex maximization formulation of general sphere packing problem (Q2307930) (← links)
• Constraints in container loading -- a state-of-the-art review (Q2355797) (← links)
• An effective hybrid algorithm for the problem of packing circles into a larger containing circle (Q2387245) (← links)
• Valid constraints for the Point Packing in a Square problem (Q2446880) (← links)
• PERM for solving circle packing problem (Q2459405) (← links)
• Adaptive and restarting techniques-based algorithms for circular packing problems (Q2479825) (← links)
• New heuristics for packing unequal circles into a circular container (Q2489278) (← links)
• Packing disks into disks with optimal worst-case density (Q2679596) (← links)
• Approximation schemes for covering and packing problems in image processing and VLSI (Q3771608) (← links)
• Approximate Packing: Integer Programming Models, Valid Inequalities and Nesting (Q4634978) (← links)
• Packing equal circles into a circle with circular prohibited areas (Q4903496) (← links)
• (Q5088965) (← links)
• Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition) (Q5088996) (← links)
• Cylinder packing by simulated annealing (Q5189102) (← links)