Zobrazeno 1 - 10
of 121
pro vyhledávání: '"Miyazawa, Flávio Keidi"'
Geometric packing problems have been investigated for centuries in mathematics. In contrast, works on sphere packing in the field of approximation algorithms are scarce. Most results are for squares and rectangles, and their d-dimensional counterpart
Externí odkaz:
http://arxiv.org/abs/2405.00246
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, vol. 23, no. 3, Discrete Algorithms (September 14, 2021) dmtcs:8325
In the $d$-dimensional hypercube bin packing problem, a given list of $d$-dimensional hypercubes must be packed into the smallest number of hypercube bins. Epstein and van Stee [SIAM J. Comput. 35 (2005)] showed that the asymptotic performance ratio
Externí odkaz:
http://arxiv.org/abs/2107.14161
Publikováno v:
In Theoretical Computer Science 20 February 2023 947
Publikováno v:
In Discrete Optimization August 2022 45
In this paper we consider the Online Bin Packing Problem in three variants: Circles in Squares, Circles in Isosceles Right Triangles, and Spheres in Cubes. The two first ones receive an online sequence of circles (items) of different radii while the
Externí odkaz:
http://arxiv.org/abs/1708.08906
Autor:
Santos, Maria João, Curcio, Eduardo, Mulati, Mauro Henrique, Amorim, Pedro, Miyazawa, Flávio Keidi
Publikováno v:
In Transportation Research Part E April 2020 136
Autor:
de Queiroz, Thiago Alves, Hokama, Pedro Henrique Del Bianco, Schouery, Rafael Crivellari Saliba, Miyazawa, Flávio Keidi
Publikováno v:
In Computers & Industrial Engineering March 2017 105:313-328
Publikováno v:
Discrete Mathematics & Theoretical Computer Science (DMTCS). 2021, Vol. 23 Issue 3, p1-13. 13p.
Publikováno v:
Mathematical Programming; Feb2023, Vol. 197 Issue 2, p813-846, 34p
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.