Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (Q1761939): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.cor.2010.06.009 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2030722793 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A multidimensional knapsack model for asset-backed securitization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial Auctions: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Manageable Combinational Auctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some integer programs arising in the design of main frame computers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving 0-1 Integer Programming Problems Arising from Large Scale Planning Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: A heuristic with tie breaking for certain 0–1 integer programming models / 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: The Theory and Computation of Knapsack Functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Solution of Discrete Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Needed: An Empirical Science of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Algorithm for Obtaining Approximate Solutions to Zero-One Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Greedy algorithm for the general multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics for the 0-1 multidimensional knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Experimental evaluation of heuristic optimization algorithms: A tutorial / 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: The Effects of Coefficient Correlation Structure in Two-Dimensional Knapsack Problems on Solution Procedure Performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4821303 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multivariate composite distributions for coefficients in synthetic optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Synthetic Optimization Problem Generation: Show Us the Correlations! / 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: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The multidimensional 0-1 knapsack problem -- bounds and computational aspects / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The core concept for the Multidimensional Knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A recursive branch and bound algorithm for the multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 22:03, 5 July 2024

scientific article
Language Label Description Also known as
English
Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem
scientific article

    Statements

    Problem reduction heuristic for the \(0\)-\(1\) multidimensional knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    15 November 2012
    0 references
    heuristic optimization
    0 references
    design of algorithms
    0 references
    multi-dimensional knapsack problem
    0 references
    core problem
    0 references
    0 references
    0 references

    Identifiers