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

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A Bibliographical Survey On Some Well-Known Non-Standard Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on the knapsack problem with special ordered sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: A o(n logn) algorithm for LP knapsacks with GUB constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the multiple-choice knapsack linear program / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for the linear multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The linear multiple choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Multiple Choice Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate algorithms for some generalized knapsack problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Choice Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A computational study of a multiple-choice knapsack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3844775 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for determining the convex hull of a finite planar set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: LAPACK95 Users' Guide / rank
 
Normal rank

Revision as of 17:01, 6 June 2024

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