2 papers indexed here
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
An approach that separates geometric visibility preprocessing from a portfolio of incremental combinatorial searches is described, complemented by exact discrete one-swap descent, ruin-and-recreate, and elite crossover.
We consider the problem of online packing of convex polygons into a strip by translations. While online algorithms with a constant competitive ratio have been known for rectangles for decades [Baker and Schwarz, SICOMP 1983], the current best algorithm for convex polygons has competitive ratio $O(n^{\log_2 3-1}\log n)...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.
