%0 Journal Article %1 noauthororeditor %A Zehmakan, AbdolahadNoori %D 2015 %J International Journal on Foundations of Computer Science & Technology (IJFCST) %K Bin Packing Problem algorithm approximation %N 4 %P 11 %R 10.5121/ijfcst.2015.5401 %T BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMS %U https://wireilla.com/papers/ijfcst/V5N4/5415ijfcst01.pdf %V 5 %X 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.

@article{noauthororeditor, abstract = {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.}, added-at = {2018-08-06T07:34:30.000+0200}, author = {Zehmakan, AbdolahadNoori}, biburl = {https://www.bibsonomy.org/bibtex/23554fb7ad51597078ab99e5c43a9c56e/devino}, doi = {10.5121/ijfcst.2015.5401}, interhash = {c8b62d240b3cb6a0c5f7fd8e757ee534}, intrahash = {3554fb7ad51597078ab99e5c43a9c56e}, journal = {International Journal on Foundations of Computer Science & Technology (IJFCST) }, keywords = {Bin Packing Problem algorithm approximation}, language = {english}, month = {july}, number = 4, pages = 11, timestamp = {2018-08-06T07:34:30.000+0200}, title = {BIN PACKING PROBLEM: TWO APPROXIMATION ALGORITHMS}, url = {https://wireilla.com/papers/ijfcst/V5N4/5415ijfcst01.pdf}, volume = 5, year = 2015 }