[图书][B] Handbook of approximation algorithms and metaheuristics
TF Gonzalez - 2007 - taylorfrancis.com
Delineating the tremendous growth in this area, the Handbook of Approximation Algorithms
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
and Metaheuristics covers fundamental, theoretical topics as well as advanced, practical …
Improved bound for online square-into-square packing
B Brubach - International Workshop on Approximation and Online …, 2014 - Springer
We show a new algorithm and improved bound for the online square-into-square packing
problem using a hybrid shelf-packing approach. This 2-dimensional packing problem …
problem using a hybrid shelf-packing approach. This 2-dimensional packing problem …
Online square-into-square packing
SP Fekete, HF Hoffmann - Algorithmica, 2017 - Springer
Abstract In 1967, Moon and Moser proved a tight bound on the critical density of squares in
squares: any set of squares with a total area of at most 1/2 can be packed into a unit square …
squares: any set of squares with a total area of at most 1/2 can be packed into a unit square …
Online removable square packing
The online removable square packing problem is a two-dimen-sional version of the online
removable Knapsack problem. For a sequence of squares with side length at most 1, we are …
removable Knapsack problem. For a sequence of squares with side length at most 1, we are …
[HTML][HTML] Packing batches of cubes into a single bin
J Januszewski, Ł Zielonka - Information Processing Letters, 2023 - Elsevier
In λ-packing items are grouped in batches. Items arrive one by one (online) and they are
stored in a buffer until either the total volume of stored items is greater than or equal to λ or …
stored in a buffer until either the total volume of stored items is greater than or equal to λ or …
Online sorting and translational packing of convex polygons
We investigate several online packing problems in which convex polygons arrive one by
one and have to be placed irrevocably into a container, while the aim is to minimize the used …
one and have to be placed irrevocably into a container, while the aim is to minimize the used …
Improved online algorithms for 1-space bounded 2-dimensional bin packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A
sequence of rectangular items (square items, respectively) arrive over time, which must be …
sequence of rectangular items (square items, respectively) arrive over time, which must be …
One-space bounded algorithms for two-dimensional bin packing
In this paper, we study the bounded space variation, especially one-space bounded, of two-
dimensional bin packing. A sequence of rectangular items arrive over time, and the following …
dimensional bin packing. A sequence of rectangular items arrive over time, and the following …
[HTML][HTML] Online algorithms for 1-space bounded 2-dimensional bin packing and square packing
In this paper, we study 1-space bounded 2-dimensional bin packing and square packing. A
sequence of rectangular items (square items) arrive one by one, each item must be packed …
sequence of rectangular items (square items) arrive one by one, each item must be packed …
Online algorithms for 1-space bounded multi dimensional bin packing and hypercube packing
In this paper, we study 1-space bounded multi-dimensional bin packing and hypercube
packing. A sequence of items arrive over time, each item is ad-dimensional hyperbox (in bin …
packing. A sequence of items arrive over time, each item is ad-dimensional hyperbox (in bin …