Cultural advice

The Australian National University acknowledges, celebrates and pays our respects to the Ngunnawal and Ngambri people of the Canberra region and to all First Nations Australians on whose traditional lands we meet and work, and whose cultures are among the oldest continuing cultures in human history.

Aboriginal and Torres Strait Islander peoples are advised that ANU Library collections may include images, names, voices, and other representations of deceased persons.

Material in the collection may contain terms, language or views that reflect the period in which the item was created and may be considered inappropriate today.

Bin Packing Problem: Two Approximation Algorithms

Simple item page
dc.contributor.authorZehmakan, Abdolahad Noorien
dc.date.accessioned2026-10-01T08:40:33Z
dc.date.available2026-10-01T08:40:33Z
dc.date.issued2015en
dc.description.abstractThe 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 order O(n), unless P=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 are compared with some other approximation algorithms. The experimental results show the suggested algorithms perform efficiently. In summary, the main goal of the research is presenting methods which not only enjoy the best theoretical criteria, but also perform considerably efficient in practice.en
dc.identifier.otherdblp:journals/corr/Zehmakan15en
dc.identifier.otherORCID:/0000-0002-8569-6347/work/228394639en
dc.identifier.urihttps://hdl.handle.net/1885/733815985
dc.rightsDBLP's bibliographic metadata records provided through http://dblp.org/search/publ/api are distributed under a Creative Commons CC0 1.0 Universal Public Domain Dedication. Although the bibliographic metadata records are provided consistent with CC0 1.0 Dedication, the content described by the metadata records is not. Content may be subject to copyright, rights of privacy, rights of publicity and other restrictions.en
dc.titleBin Packing Problem: Two Approximation Algorithmsen
dc.typeWorking/Technical Paperen
dspace.entity.typePublicationen
local.contributor.affiliationZehmakan, Abdolahad Noori; Sharif University of Technologyen
local.identifier.pure28c0c0e0-7bb7-474e-ac47-908c967f2c12en
local.type.statusPublisheden

Downloads

Collections

ANU Research Publications

DSpace software copyright © 2002-2026 LYRASIS