Subadditive lifting methods for partitioning and knapsack problems (Q3877407): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0196-6774(80)90006-1 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2071481456 / rank
 
Normal rank

Latest revision as of 19:26, 19 March 2024

scientific article
Language Label Description Also known as
English
Subadditive lifting methods for partitioning and knapsack problems
scientific article

    Statements

    Subadditive lifting methods for partitioning and knapsack problems (English)
    0 references
    1980
    0 references
    knapsack problem
    0 references
    subadditive function
    0 references
    duality
    0 references
    subadditive lifting methods
    0 references
    packing
    0 references
    covering
    0 references
    partitioning
    0 references
    knapsack-partitioning problem
    0 references
    single equality constraint
    0 references
    implementations
    0 references
    dual simplex algorithm
    0 references
    shortest path methods
    0 references
    dynamic programming
    0 references
    group approach
    0 references
    branch-and- bound
    0 references
    dual feasible subadditive lifting methods
    0 references
    0 references

    Identifiers