Can I read New Algorithms for Bin Packing Problem on EtoBox?

New Algorithms for Bin Packing Problem by ijfcstjournal is a document available to read on EtoBox.

What is New Algorithms for Bin Packing Problem about?

The Bin Packing Problem is one of the most important optimization problems. In recent years, due to its NP-hard nature, several approximation algorithms have been presented. It is proved that the best algorithm for the Bin Packing Problem has the approximation ratio 3/2 and the time orderO(n), unlessP=NP. In this paper, first, a 3/2 -approximation algorithm is presented, then a modification to FFD algorithm is proposed to decrease time order to linear. Finally, these suggested approximation algorithms

Author

ijfcstjournal

Language

EN