. . "El relleno con c\u00EDrculos de un tri\u00E1ngulo is\u00F3sceles rect\u00E1ngulo es un problema de empaquetado donde el objetivo es acomodar n c\u00EDrculos de radio unidad en un tri\u00E1ngulo is\u00F3sceles rect\u00E1ngulo lo m\u00E1s peque\u00F1o posible."@es . "\uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC5D0 \uC6D0 \uCC44\uC6B0\uAE30\uB294 \uAC00\uC7A5 \uC791\uC740 \uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC744 n \uAC1C\uC758 \uB2E8\uC704\uC6D0\uC73C\uB85C \uCC44\uC6B0\uB294 \uCC44\uC6B0\uAE30 \uBB38\uC81C\uC774\uB2E4. \uCD5C\uC18C\uD574(\uAE38\uC774\uB294 \uBE57\uBCC0\uC758 \uAE38\uC774\uC774\uB2E4)\uB97C \uC544\uB798\uC758 \uD45C\uC5D0 \uB098\uD0C0\uB0C8\uB2E4. \uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC548\uC5D0 n\uAC1C\uC758 \uC810\uB4E4\uAC04\uC758 \uCD5C\uC18C\uAC70\uB9AC\uB97C \uCD5C\uB300\uD654\uD558\uB294 \uBB38\uC81C\uC758 \uD574\uC640 \uAC19\uC740 \uCD5C\uC801\uD574\uB294 n< 8\uC77C \uB54C \uCD5C\uC801\uC784\uC774 \uC99D\uBA85\uB418\uC5C8\uB2E4. In 2011\uB144\uC5D0 \uC774 \uC774\uC804\uC5D0 \uCD5C\uC801\uC774\uB77C\uACE0 \uC54C\uB824\uC9C4 \uD574\uC5D0\uC11C 18\uAC1C\uC758 \uAC1C\uC120\uC810\uC744 \uCC3E\uC544\uB0C8\uC73C\uBA70, \uADF8 \uC911 \uAC00\uC7A5 \uC791\uC740 \uAC83\uC740 n=13\uC77C \uB54C\uC774\uB2E4."@ko . "\uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC5D0 \uC6D0 \uCC44\uC6B0\uAE30\uB294 \uAC00\uC7A5 \uC791\uC740 \uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC744 n \uAC1C\uC758 \uB2E8\uC704\uC6D0\uC73C\uB85C \uCC44\uC6B0\uB294 \uCC44\uC6B0\uAE30 \uBB38\uC81C\uC774\uB2E4. \uCD5C\uC18C\uD574(\uAE38\uC774\uB294 \uBE57\uBCC0\uC758 \uAE38\uC774\uC774\uB2E4)\uB97C \uC544\uB798\uC758 \uD45C\uC5D0 \uB098\uD0C0\uB0C8\uB2E4. \uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC548\uC5D0 n\uAC1C\uC758 \uC810\uB4E4\uAC04\uC758 \uCD5C\uC18C\uAC70\uB9AC\uB97C \uCD5C\uB300\uD654\uD558\uB294 \uBB38\uC81C\uC758 \uD574\uC640 \uAC19\uC740 \uCD5C\uC801\uD574\uB294 n< 8\uC77C \uB54C \uCD5C\uC801\uC784\uC774 \uC99D\uBA85\uB418\uC5C8\uB2E4. In 2011\uB144\uC5D0 \uC774 \uC774\uC804\uC5D0 \uCD5C\uC801\uC774\uB77C\uACE0 \uC54C\uB824\uC9C4 \uD574\uC5D0\uC11C 18\uAC1C\uC758 \uAC1C\uC120\uC810\uC744 \uCC3E\uC544\uB0C8\uC73C\uBA70, \uADF8 \uC911 \uAC00\uC7A5 \uC791\uC740 \uAC83\uC740 n=13\uC77C \uB54C\uC774\uB2E4."@ko . . . . . . . . "Circle packing in an isosceles right triangle"@en . . . . . . "31950365"^^ . . . "Empilement de cercles dans un triangle isoc\u00E8le rectangle"@fr . "1117586353"^^ . . . "Relleno con c\u00EDrculos de un tri\u00E1ngulo is\u00F3sceles rect\u00E1ngulo"@es . . "El relleno con c\u00EDrculos de un tri\u00E1ngulo is\u00F3sceles rect\u00E1ngulo es un problema de empaquetado donde el objetivo es acomodar n c\u00EDrculos de radio unidad en un tri\u00E1ngulo is\u00F3sceles rect\u00E1ngulo lo m\u00E1s peque\u00F1o posible."@es . . "L'empilement de cercles dans un triangle isoc\u00E8le rectangle est un probl\u00E8me d'empilement bidimensionnel dont l'objectif est d'empiler des cercles unit\u00E9s identiques de nombre n dans le triangle isoc\u00E8le rectangle le plus petit possible. Les solutions minimales sont indiqu\u00E9es dans le tableau ci-dessous. Des solutions optimales sont connues pour n < 8. En 2011, un algorithme heuristique a trouv\u00E9 18 am\u00E9liorations sur les optimum connus pr\u00E9c\u00E9demment, le plus petit \u00E9tant pour n < 13."@fr . . "L'empilement de cercles dans un triangle isoc\u00E8le rectangle est un probl\u00E8me d'empilement bidimensionnel dont l'objectif est d'empiler des cercles unit\u00E9s identiques de nombre n dans le triangle isoc\u00E8le rectangle le plus petit possible. Les solutions minimales sont indiqu\u00E9es dans le tableau ci-dessous. Des solutions optimales sont connues pour n < 8. En 2011, un algorithme heuristique a trouv\u00E9 18 am\u00E9liorations sur les optimum connus pr\u00E9c\u00E9demment, le plus petit \u00E9tant pour n < 13."@fr . . . "2839"^^ . . . . "Circle packing in a right isosceles triangle is a packing problem where the objective is to pack n unit circles into the smallest possible isosceles right triangle. Minimum solutions (lengths shown are length of leg) are shown in the table below. Solutions to the equivalent problem of maximizing the minimum distance between n points in an isosceles right triangle, were known to be optimal for n < 8 and were extended up to n = 10. In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n = 13."@en . "Circle packing in a right isosceles triangle is a packing problem where the objective is to pack n unit circles into the smallest possible isosceles right triangle. Minimum solutions (lengths shown are length of leg) are shown in the table below. Solutions to the equivalent problem of maximizing the minimum distance between n points in an isosceles right triangle, were known to be optimal for n < 8 and were extended up to n = 10. In 2011 a heuristic algorithm found 18 improvements on previously known optima, the smallest of which was for n = 13."@en . "\uC9C1\uAC01\uC774\uB4F1\uBCC0\uC0BC\uAC01\uD615\uC5D0 \uC6D0 \uCC44\uC6B0\uAE30"@ko .