A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (Q1433165)

From MaRDI portal
Revision as of 08:39, 30 July 2024 by Openalex240730090724 (talk | contribs) (Set OpenAlex properties.)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints
scientific article

    Statements

    A branch \& bound algorithm for the 0-1 mixed integer knapsack problem with linear multiple choice constraints (English)
    0 references
    0 references
    0 references
    15 June 2004
    0 references
    mixed integer knapsack problem
    0 references
    branch-and-bound algorithm
    0 references
    multiple choice constraints
    0 references
    0 references
    0 references
    0 references

    Identifiers