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

DOI10.1016/S0020-0190(98)00115-XzbMath1339.68316OpenAlexW2076512004MaRDI QIDQ293371

Eugene Levner, George Gens

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)

Related Items (1)

An improved binary search algorithm for the Multiple-Choice Knapsack Problem

Cites Work

• A linear time randomizing algorithm for searching ranked functions
• Fast approximation algorithm for job sequencing with deadlines
• New scaling algorithms for the assignment and minimum mean cycle problems
• 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
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM
• Unnamed Item
• Unnamed Item
• Unnamed Item

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