An exact algorithm for large knapsack sharing problems (Q5883603): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: The Knapsack Sharing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact decomposition algorithm for the generalized knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Operations research applications of dichotomous search / rank
 
Normal rank
Property / cites work
 
Property / cites work: New upper bounds and exact methods for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact algorithm for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knapsack sharing problem: an exact algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An exact constructive algorithm for the knapsack sharing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Price of fairness for allocating a bounded resource / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Minimal Algorithm for the 0-1 Knapsack Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Where are the hard knapsack problems? / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Max-Min Allocation Problem: Its Solutions and Applications / rank
 
Normal rank

Latest revision as of 19:09, 31 July 2024

scientific article; zbMATH DE number 7666696
Language Label Description Also known as
English
An exact algorithm for large knapsack sharing problems
scientific article; zbMATH DE number 7666696

    Statements

    Identifiers