Show simple item record

dc.contributor.authorSerairi, M.
dc.contributor.authorHaouari, Mohamed
dc.date.accessioned2012-05-30T13:26:28Z
dc.date.available2012-05-30T13:26:28Z
dc.date.issued2010-08-01
dc.identifier.issn1571-0653
dc.identifier.urihttp://hdl.handle.net/10679/186
dc.identifier.urihttp://www.sciencedirect.com/science/article/pii/S1571065310001149
dc.descriptionDue to copyright restrictions, the access to the full text of this article is only available via subscription.
dc.description.abstractWe survey lower bounds for the variant of the two-dimensional bin packing problem where items cannot be rotated. We prove that the dominance relation claimed by Carlier et al. between their lower bounds and those of Boschetti and Mingozzi is not valid. We analyze the performance of lower bounds from the literature and we provide the results of a computational experiment.en_US
dc.language.isoengen_US
dc.publisherElsevieren_US
dc.relation.ispartofElectronic Notes in Discrete Mathematics
dc.rightsrestrictedAccess
dc.titleA computational study of lower bounds for the two dimensional bin packing problemen_US
dc.typeConference paperen_US
dc.peerreviewedyesen_US
dc.publicationstatuspublisheden_US
dc.contributor.departmentÖzyeğin University
dc.contributor.ozuauthorHaouari, Mohamed
dc.identifier.volume36
dc.identifier.startpage891
dc.identifier.endpage897
dc.identifier.doi10.1016/j.endm.2010.05.113
dc.subject.keywordsBin packing problemen_US
dc.subject.keywordsLower boundsen_US
dc.subject.keywordsDual feasible functionen_US
dc.identifier.scopusSCOPUS:2-s2.0-77954898335
dc.contributor.authorMale1


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