Resolution of the 0–1 knapsack problem: Comparison of methods (Q4074670): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Discrete Programming by the Filter Method / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transformation of integer programs to knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4053390 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Programming by Implicit Enumeration and Balas’ Method / 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: A Multiphase-Dual Algorithm for the Zero-One Integer Programming Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Surrogate Constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Branch Search Algorithm for the Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shrinking Boundary Algorithm for Discrete System Models / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer Linear Programming: A Study in Computational Efficiency / rank
 
Normal rank

Revision as of 16:30, 12 June 2024

scientific article
Language Label Description Also known as
English
Resolution of the 0–1 knapsack problem: Comparison of methods
scientific article

    Statements

    Identifiers