Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal selection of stochastic intervals under a sum constraint / 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: Worst-case analysis of greedy algorithms for the unbounded knapsack, subset-sum and partition problems / 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: Q4002885 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Methods in the Probabilistic Analysis of Sequencing and Packing Heuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the subset-sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving low-density subset sum problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Lagarias-Odlyzko Algorithm for the Subset Sum Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Largest-first sequential selection with a sum constraint / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / 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: Q3773321 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3619797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040797 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breaking Records and Breaking Boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4101255 / rank
 
Normal rank

Latest revision as of 10:55, 29 May 2024

scientific article
Language Label Description Also known as
English
Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations
scientific article

    Statements

    Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (English)
    0 references
    0 references
    15 March 2000
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    approximation algorithm
    0 references
    sequential selection
    0 references
    knapsack problem
    0 references
    maximum subset sum problem
    0 references
    average-case performance
    0 references
    on-line approximation algorithm
    0 references
    recurrence relations
    0 references
    job scheduling
    0 references
    multiprogrammed parallel systems
    0 references