Heuristic algorithms for the multiple knapsack problem (Q1148788): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / describes a project that uses
 
Property / describes a project that uses: Algorithm 37 / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic routine for solving large loading problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for 0-1 multiple-knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithm 37. Algorithm for the solution of the 0-1 single Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solution of the zero-one multiple knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A bound and bound algorithm for the zero-one multiple knapsack problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02243544 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2922809901 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 11:55, 30 July 2024

scientific article
Language Label Description Also known as
English
Heuristic algorithms for the multiple knapsack problem
scientific article

    Statements

    Heuristic algorithms for the multiple knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    1981
    0 references
    0 references
    heuristic algorithms
    0 references
    multiple knapsack problem
    0 references
    suboptimal solutions
    0 references
    computational experience
    0 references
    implementation
    0 references
    random test problems
    0 references
    large size problems
    0 references
    0 references