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

From MaRDI portal
Revision as of 11:08, 20 July 2023 by Importer (talk | contribs) (‎Created a new Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
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