On dominated terms in the general knapsack problem (Q1371953): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Reducing the number of variables in integer and linear programming problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on dominance relation in unbounded knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Age of Optimization: Solving Large-Scale Real-World Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Core Problems in Knapsack Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new enumeration scheme for the knapsack problem / rank
 
Normal rank

Revision as of 18:54, 27 May 2024

scientific article
Language Label Description Also known as
English
On dominated terms in the general knapsack problem
scientific article

    Statements

    On dominated terms in the general knapsack problem (English)
    0 references
    0 references
    0 references
    22 April 1998
    0 references
    identification of dominated terms
    0 references
    general knapsack problem
    0 references
    parametric right-hand side
    0 references

    Identifiers