An exact algorithm for the 0-1 collapsing knapsack problem (Q1327229): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3661315 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / 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: Fast Approximation Algorithms for Knapsack Problems / 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: The Collapsing 0–1 Knapsack Problem / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0166-218x(94)90208-9 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2022526624 / rank
 
Normal rank

Latest revision as of 10:53, 30 July 2024

scientific article
Language Label Description Also known as
English
An exact algorithm for the 0-1 collapsing knapsack problem
scientific article

    Statements

    An exact algorithm for the 0-1 collapsing knapsack problem (English)
    0 references
    0 references
    0 references
    15 June 1994
    0 references
    satellite communications
    0 references
    0-1 collapsing knapsack problem
    0 references
    implicit enumeration
    0 references

    Identifiers