A branch and bound algorithm for solving the multiple-choice knapsack problem (Q760766): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q56324179, #quickstatements; #temporary_batch_1707149277123
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-0427(84)90023-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045247420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091421 / 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: Pivot and Complement–A Heuristic for 0-1 Programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: A mathematical programming system for preference and compatibility maximized menu planning and scheduling / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4132250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675139 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4178782 / 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: Q3885184 / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 0-1 knapsack problem with multiple choice constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Multiple-Choice Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3932565 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3865832 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Linear Multiple Choice Knapsack Problem / rank
 
Normal rank

Latest revision as of 15:36, 14 June 2024

scientific article
Language Label Description Also known as
English
A branch and bound algorithm for solving the multiple-choice knapsack problem
scientific article

    Statements

    A branch and bound algorithm for solving the multiple-choice knapsack problem (English)
    0 references
    0 references
    1984
    0 references
    pegging test
    0 references
    multiple-choice knapsack problem
    0 references
    branch and bound algorithm
    0 references
    Computational experience
    0 references
    comparisons
    0 references

    Identifiers