Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (Q3557805): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: On variations of the subset sum problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Knapsack problems for NL / rank
 
Normal rank
Property / cites work
 
Property / cites work: The iterated mod problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4312125 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Exact Algorithm for the Two-Constraint 0–1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A best first search exact algorithm for the multiple-choice multidimensional knapsack problem / rank
 
Normal rank

Latest revision as of 19:00, 2 July 2024

scientific article
Language Label Description Also known as
English
Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions
scientific article

    Statements

    Remarks on 0-1 Optimization Problems with Superincreasing and Superdecreasing Objective Functions (English)
    0 references
    0 references
    23 April 2010
    0 references
    upper and lower bound
    0 references
    polynomial procedure
    0 references
    complexities
    0 references

    Identifiers