A minimal algorithm for the multiple-choice knapsack problem (Q1388832): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q58826519, #quickstatements; #temporary_batch_1712201099914
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A computational study of a multiple-choice knapsack algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Algorithm for Large Zero-One Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Discrete-Variable Extremum Problems / 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: Exact methods for the knapsack problem and its generalizations / 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 branch and bound algorithm for solving the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithm for the solution of the 0-1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lagrangian Relaxation Method for Solving Integer Programming Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quicksort / rank
 
Normal rank
Property / cites work
 
Property / cites work: A New Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / 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: A minimal algorithm for the multiple-choice knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An expanding-core algorithm for the exact \(0-1\) knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the Bounded Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3678962 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 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: An O(n) algorithm for the linear multiple choice knapsack problem and related problems / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0377-2217(95)00015-i / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2086168649 / rank
 
Normal rank

Latest revision as of 10:08, 30 July 2024

scientific article
Language Label Description Also known as
English
A minimal algorithm for the multiple-choice knapsack problem
scientific article

    Statements

    A minimal algorithm for the multiple-choice knapsack problem (English)
    0 references
    0 references
    11 June 1998
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    knapsack problem
    0 references
    dynamic programming
    0 references
    reduction
    0 references
    multiple-choice knapsack problem
    0 references
    partitioning
    0 references
    0 references
    0 references