A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (Q941476): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: An Additive Algorithm for Solving Linear Programs with Zero-One Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A genetic algorithm for the multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simulated annealing approach to the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient tabu search approach for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic algorithm for the multidimensional zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic solution procedure for the multiconstraint zero-one knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Algorithms for the 0/1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch and Bound Method for the Multiconstraint Zero-One Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Heuristic for Multidimensional 0-1 Knapsack Problems / rank
 
Normal rank

Revision as of 14:48, 28 June 2024

scientific article
Language Label Description Also known as
English
A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles
scientific article

    Statements

    A new polynomial time algorithm for 0-1 multiple knapsack problem based on dominant principles (English)
    0 references
    0 references
    0 references
    1 September 2008
    0 references
    0-1 multi-constrained knapsack problem
    0 references
    heuristic
    0 references
    computational complexity
    0 references
    NP-hard problems
    0 references
    numerical examples
    0 references

    Identifiers

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