Average performance of greedy heuristics for the integer knapsack problem. (Q1420409): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded knapsack problem: Dynamic programming revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic analysis of multiprocessor list scheduling: the erlang case / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic bounds for dual bin-packing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Travelling Salesman and Assignment Problems: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: A stochastic model of bin-packing / 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: A probabilistic analysis of the next fit decreasing bin packing heuristic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-Case Analysis of Heuristic Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of the Planar <i>k</i>-Median Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic analysis of the Davis Putnam procedure for solving the satisfiability problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymptotic Properties of the Quadratic Assignment Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic Analysis of Partitioning Algorithms for the Traveling-Salesman Problem in the Plane / rank
 
Normal rank
Property / cites work
 
Property / cites work: Average Performance of Heuristics for Satisfiability / rank
 
Normal rank
Property / cites work
 
Property / cites work: A total-value greedy heuristic for the integer knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Satisfiability Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New trends in exact algorithms for the \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247440 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The average-case analysis of some on-line algorithms for bin packing / rank
 
Normal rank

Latest revision as of 14:28, 6 June 2024

scientific article
Language Label Description Also known as
English
Average performance of greedy heuristics for the integer knapsack problem.
scientific article

    Statements

    Average performance of greedy heuristics for the integer knapsack problem. (English)
    0 references
    0 references
    0 references
    0 references
    2 February 2004
    0 references
    0 references
    0 references
    0 references
    0 references
    Heuristics
    0 references
    Combinatorial optimization
    0 references
    Integer programming
    0 references
    Knapsack
    0 references
    Probabilistic algorithm
    0 references