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

DOI10.1016/S0020-0190(98)00115-XzbMATH Open1339.68316OpenAlexW2076512004MaRDI QIDQ293371FDOQ293371

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

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

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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Fast approximation algorithm for job sequencing with deadlines
• Fast Approximation Algorithms for Knapsack Problems
• New scaling algorithms for the assignment and minimum mean cycle problems
• 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
• Title not available (Why is that?)
• THE MULTIPLE-CHOICE KNAPSACK PROBLEM

Cited In (2)

• Title not available (Why is that?)
• 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)