#### Filter Results:

- Full text PDF available (4)

#### Publication Year

2015

2016

- This year (0)
- Last 5 years (4)
- Last 10 years (4)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Abdolahad Noori Zehmakan
- ArXiv
- 2015

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 -approximation algorithm is… (More)

- Abdolahad Noori Zehmakan, Mojtaba Eslahi
- ArXiv
- 2015

The Bin Packing Problem is one of the most important Combinatorial Optimization problems in optimization and has a lot of real-world applications. Many approximation algorithms have been presented for this problem because of its NP-hard nature. In this article also a new creative approximation algorithm is presented for this important problem. It has been… (More)

Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of and the time order of ( ), unless = . In the current paper, a linear approximation algorithm is presented. The suggested algorithm not only… (More)

- Abdolahad Noori Zehmakan
- ArXiv
- 2015

Since the Bin Packing Problem (BPP) is one of the main NP-hard problems, a lot of approximation algorithms have been suggested for it. It has been proven that the best algorithm for BPP has the approximation ratio of 3 2 and the time order of O(n), unless P = NP. In the current paper, a linear 3 2 -approximation algorithm is presented. The suggested… (More)

- ‹
- 1
- ›