Upper bounds and algorithms for the maximum cardinality bin packing problem. (Q1399594): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4952619 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bin packing: Maximizing the number of pieces packed / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Multiple Knapsack Problems by Cutting Planes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of a heuristic for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4941826 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the dual bin packing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristic algorithms for the multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds and reduction procedures for the bin packing problem / rank
 
Normal rank

Revision as of 17:47, 5 June 2024

scientific article
Language Label Description Also known as
English
Upper bounds and algorithms for the maximum cardinality bin packing problem.
scientific article

    Statements

    Identifiers