Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

Asymptotic Worst-Case Analyses for the Open Bin Packing Problem

The open bin packing problem (OBPP) is a new variant of the well-known bin packing problem. In the OBPP, items are packed into bins so that the total content before the last item in each bin is strictly less than the bin capacity. The objective is to minimize the number of bins used. The application...

Full description

Bibliographic Details
Main Author: Ongkunaruk, Pornthipa
Other Authors: Industrial and Systems Engineering
Format: Others
Published: Virginia Tech 2014
Subjects:
Asymptotic Worst-Case Performance Ratio
Off-Line Algorithms
Bin Packing
Online Access:http://hdl.handle.net/10919/30105
http://scholar.lib.vt.edu/theses/available/etd-12152005-230125/

Internet

http://hdl.handle.net/10919/30105
http://scholar.lib.vt.edu/theses/available/etd-12152005-230125/

Similar Items