New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing proble...
New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
About this item
Full title
Author / Creator
Publisher
London: Taylor & Francis Group
Journal title
Language
English
Formats
Publication information
Publisher
London: Taylor & Francis Group
Subjects
More information
Scope and Contents
Contents
The bin-packing problem consists of determining the minimum number of bins needed to pack a given set of n items. It has been shown that the dual-feasible functions (DFF) proposed by Johnson and the data-dependent DFF (DDFF) proposed by the present authors can be used to obtain good lower bounds for bin-packing problems. In a recent paper we propos...
Alternative Titles
Full title
New data-dependent dual-feasible functions and lower bounds for a two-dimensional bin-packing problem
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_hal_primary_oai_HAL_hal_04816866v1
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_hal_primary_oai_HAL_hal_04816866v1
Other Identifiers
ISSN
0020-7543
E-ISSN
1366-588X
DOI
10.1080/00207540802426656
