Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (Q2185833): Difference between revisions

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3029974580 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1901.01215 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4418373 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tabu search and finite convergence / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5704408 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stochastic Algorithms: Foundations and Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the convergence of tabu search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4836494 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matheuristics / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey of effective heuristics and their application to a variety of knapsack problems / rank
 
Normal rank

Latest revision as of 20:37, 22 July 2024

scientific article
Language Label Description Also known as
English
Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem
scientific article

    Statements

    Analysis of divide-and-conquer strategies for the \(0-1\) minimization knapsack problem (English)
    0 references
    0 references
    0 references
    5 June 2020
    0 references
    divide-and-conquer
    0 references
    knapsack problem
    0 references
    Monte Carlo simulations
    0 references
    method's efficiency
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references