Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (Q1383928): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Added link to MaRDI item.
links / mardi / namelinks / mardi / name
 

Revision as of 16:35, 31 January 2024

scientific article
Language Label Description Also known as
English
Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem
scientific article

    Statements

    Two-phases method and branch and bound procedures to solve the bi-objective knapsack problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    5 August 1998
    0 references
    0 references
    combinatorial optimization
    0 references
    multiobjective programming
    0 references
    knapsack problem
    0 references
    0-1 knapsack problem
    0 references
    two objectives
    0 references
    efficient solutions
    0 references