On-line algorithms for bin-covering problems with known item distributions

On-line algorithms for bin-covering problems with known item distributions

This thesis focuses on algorithms solving the on-line Bin-Covering problem, when the items are generated from a known, stationary distribution. We introduce the Prospect Algorithm. The main idea behind the Prospect Algorithm is to use information on the item distribution to estimate how easy it wil...

Full description

Bibliographic Details
Main Author: Asgeirsson, Agni
Other Authors: Andradottir, Sigrun
Format: Others
Language:en_US
Published: Georgia Institute of Technology 2015
Subjects:
Bin-covering
Bin-packing
Algorithms
Markov decision processies
MDP
Simulation
Knapsack
Next-fit
Inspection theorem
Online Access:http://hdl.handle.net/1853/53413

Internet

http://hdl.handle.net/1853/53413

Similar Items