2015/09/20 by Abdolahad Noori Zehmakan, Zehmakan, Abdolahad Noori, Mojtaba Eslahi +1
Engineering · #Advanced Manufacturing and Logistics Optimization #Data Structures and Algorithms (cs.DS) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #Optimization and Packing Problems #Vehicle Routing Optimization Methods
paper · pdf · doi:10.48550/arxiv.1509.06048
openalex publication_date 2015/09/20 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
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 proven that the best approximation ratio and the best time order for the Bin Packing Problem are 3/2 and O(n), respectively unless P=NP. The presented algorithm in this article has the best possible factors, O(n) and 3/2.