Show simple item record

dc.contributor.authorHaouari, Mohamed
dc.contributor.authorSerairi, M.
dc.date.accessioned2012-05-31T12:56:54Z
dc.date.available2012-05-31T12:56:54Z
dc.date.issued2011-03
dc.identifier.issn0926-6003
dc.identifier.urihttp://hdl.handle.net/10679/191
dc.identifier.urihttp://www.springerlink.com/content/x0p34406038n4j66/
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractWe address a generalization of the classical one-dimensional bin packing problem with unequal bin sizes and costs. We investigate lower bounds for this problem as well as exact algorithms. The main contribution of this paper is to show that embedding a tight network flow-based lower bound, dominance rules, as well as an effective knapsack-based heuristic in a branch-and-bound algorithm yields very good performance. In addition, we show that the particular case with all weight items larger than a third the largest bin capacity can be restated and solved in polynomial-time as a maximum-weight matching problem in a nonbipartite graph. We report the results of extensive computational experiments that provide evidence that large randomly generated instances are optimally solved within moderate CPU times.en_US
dc.description.sponsorshipFatimah Alnijris’ Research Chair for Advanced Manufacturing Technology
dc.language.isoengen_US
dc.publisherSpringer Science+Business Mediaen_US
dc.relation.ispartofComputational Optimization and Application
dc.rightsrestrictedAccess
dc.titleRelaxations and exact solution of the variable sized bin packing problemen_US
dc.typeArticleen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.authorID(ORCID 0000-0003-0767-8220 & YÖK ID ) Haouari, Mohamed
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume48
dc.identifier.issue2
dc.identifier.startpage345
dc.identifier.endpage368
dc.identifier.wosWOS:000288551600010
dc.identifier.doi10.1007/s10589-009-9276-z
dc.subject.keywordsBin packing problemen_US
dc.subject.keywordsLower boundsen_US
dc.subject.keywordsBranch-and-bounden_US
dc.identifier.scopusSCOPUS:2-s2.0-79956138692
dc.contributor.authorMale1
dc.relation.publicationcategoryArticle - International Refereed Journal - Institutional Academic Staff


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record


Share this page