An approximate binary search algorithm for the multiple-choice knapsack problem

George Gens, Eugene Levner

Research output: Contribution to journalArticlepeer-review

13 Scopus citations

Abstract

A fast approximation algorithm for the multiple-choice knapsack problem is proposed whose solution is guaranteed to be 4/5-bounded. The algorithm is based on binary search and runs in O(n log m) time, n being the total number of items and m the number of multiple-choice classes in the knapsack problem.

Original languageEnglish
Pages (from-to)261-265
Number of pages5
JournalInformation Processing Letters
Volume67
Issue number5
DOIs
StatePublished - 15 Sep 1998
Externally publishedYes

Keywords

  • Algorithms
  • Approximate algorithms
  • Approximate binary search
  • Knapsack problem

Fingerprint

Dive into the research topics of 'An approximate binary search algorithm for the multiple-choice knapsack problem'. Together they form a unique fingerprint.

Cite this