Probabilistic analysis of a heuristic for the dual bin packing problem (Q1824388): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0020-0190(89)90088-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1987979082 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Measure of Asymptotic Efficiency for Tests of a Hypothesis Based on the sum of Observations / 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: Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal selection of stochastic intervals under a sum constraint / rank
 
Normal rank

Latest revision as of 10:58, 20 June 2024

scientific article
Language Label Description Also known as
English
Probabilistic analysis of a heuristic for the dual bin packing problem
scientific article

    Statements