Approximation algorithms for multidimensional bin packing
The bin packing problem has been the corner stone of approximation algorithms and has been extensively studied starting from the early seventies. In the classical bin packing problem, we are given a list of real numbers in the range (0, 1], the goal is to place them in a minimum number of bins so t...
Main Author: | Khan, Arindam |
---|---|
Other Authors: | Tetali, Prasad |
Format: | Others |
Language: | en_US |
Published: |
Georgia Institute of Technology
2016
|
Subjects: | |
Online Access: | http://hdl.handle.net/1853/54371 |
Similar Items
-
Studies on Approximation Algorithms for Bin-Packing and Train Delivery Problems
by: Jing, Chen
Published: (2016) -
On Discrete Hyperbox Packing
by: Li, Xiafeng
Published: (2010) -
AN OFF-LINE DUAL MAXIMUM RESOURCE BIN PACKING MODEL FOR SOLVING THE MAINTENANCE PROBLEM IN THE AVIATION INDUSTRY
by: GEORGE CRISTIAN GRUIA, et al.
Published: (2013-05-01) -
An off-line dual maximum resource bin packing model for solving the maintenance problem in the aviation industry
by: George Cristian Gruia, et al.
Published: (2013-05-01) -
Improved Approximation Algorithms for Geometric Packing Problems With Experimental Evaluation
by: Song, Yongqiang
Published: (2003)