A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (Q2462106): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Merging and Sorting Applied to the Zero-One Knapsack Problem / rank
 
Normal rank
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: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3241581 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Enumeration Algorithm for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for some generalized 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: Solving Large-Scale Zero-One Linear Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Heuristics and reduction methods for multiple constraints 0-1 linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 bidimensional knapsack problem: Toward an efficient high-level primitive tool / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses / 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: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Improved Implicit Enumeration Approach for Integer Programming / 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: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4350063 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generating cuts from surrogate constraint analysis for zero-one and multiple choice programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logical Reduction Methods in Zero-One Programming—Minimal Preferred Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Pairing In Integer Programming / 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: Computing Partitions with Applications to the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320130 / 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: A hybrid approach to discrete mathematical programming / 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: MINTO, a Mixed INTeger Optimizer / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4040221 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cutting and surrogate constraint analysis for improved multidimensional knapsack solutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing and Probing Techniques for Mixed Integer Programming Problems / 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: Zero-one programming with many variables and few constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming algorithms for the zero-one knapsack problem / rank
 
Normal rank

Latest revision as of 12:25, 27 June 2024

scientific article
Language Label Description Also known as
English
A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem
scientific article

    Statements

    A dynamic programming based reduction procedure for the multidimensional 0-1 knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    23 November 2007
    0 references
    variable reduction
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers