An approximate binary search algorithm for the multiple-choice knapsack problem (Q293371): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(4 intermediate revisions by 4 users not shown)
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 68W25 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C27 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 90C59 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6590758 / rank
 
Normal rank
Property / zbMATH Keywords
 
knapsack problem
Property / zbMATH Keywords: knapsack problem / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate algorithm
Property / zbMATH Keywords: approximate algorithm / rank
 
Normal rank
Property / zbMATH Keywords
 
approximate binary search
Property / zbMATH Keywords: approximate binary search / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3050129 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast approximation algorithm for job sequencing with deadlines / rank
 
Normal rank
Property / cites work
 
Property / cites work: THE MULTIPLE-CHOICE KNAPSACK PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Approximation Algorithms for Knapsack Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993418 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate binary search algorithms for mean cuts and cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: New scaling algorithms for the assignment and minimum mean cycle problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A linear time randomizing algorithm for searching ranked functions / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2076512004 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:08, 30 July 2024

scientific article
Language Label Description Also known as
English
An approximate binary search algorithm for the multiple-choice knapsack problem
scientific article

    Statements

    Identifiers