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

DOI10.1016/S0020-0190(98)00115-XMaRDI QIDQ293371zbMATH OpenOpenAlexFDO

Authors George Gens, Eugene Levner

Publication date 9 June 2016

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL http://www.sciencedirect.com/science/article/pii/S002001909800115X?np=y

zbMATH Keywords

knapsack problemapproximate algorithmapproximate binary search

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)

Recommendations

• An improved binary search algorithm for the multiple-choice knapsack problem
• A branch and bound algorithm for solving the multiple-choice knapsack problem
• A best first search exact algorithm for the multiple-choice multidimensional knapsack problem
• A successive approximation algorithm for the multiple knapsack problem
• A new approximate algorithm for the knapsack problem
• A Fast Approximation Scheme for the Multiple Knapsack Problem
• A binary differential search algorithm for the 0-1 multidimensional knapsack problem
• scientific article; zbMATH DE number 3889280
• A multi-criteria approach to approximate solution of multiple-choice knapsack problem
• Approximation schemes for multiperiod binary knapsack problems

Cites work

• scientific article; zbMATH DE number 3644795 (Why is no real title available?)
• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• A linear time randomizing algorithm for searching ranked functions
• A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
• Approximate binary search algorithms for mean cuts and cycles
• Fast Approximation Algorithms for Knapsack Problems
• Fast approximation algorithm for job sequencing with deadlines
• New scaling algorithms for the assignment and minimum mean cycle problems
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM

Cited in

(2)

• scientific article; zbMATH DE number 708859 (Why is no real title available?)
• An improved binary search algorithm for the multiple-choice knapsack problem

This page was built for publication: An approximate binary search algorithm for the multiple-choice knapsack problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q293371)