Algorithms with guarantee value for knapsack problems

DOI10.1080/02331934.2011.617818MaRDI QIDQ2903135zbMATH OpenOpenAlexFDO

Authors Asli Guler, Urfat G. Nuriyev, Murat Ersen Berberler, F. Nuriyeva

Publication date 23 August 2012

Published in Optimization (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/02331934.2011.617818

Mathematics Subject Classification ID

Boolean programming (90C09) Integer programming (90C10) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A class of generalized greedy algorithms for the multi-knapsack problem
• An extension of a greedy heuristic for the knapsack problem
• An algorithm for solving a class of knapsack problems and its generalization
• A total-value greedy heuristic for the integer knapsack problem
• Joint performance of greedy heuristics for the integer knapsack problem

Cites work

• An exact algorithm for large unbounded knapsack problems
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
• scientific article; zbMATH DE number 1330033 (Why is no real title available?)
• scientific article; zbMATH DE number 2107164 (Why is no real title available?)
• Worst-Case Analysis of Heuristic Algorithms

Cited in

(1)

• A new effective dynamic program for an investment optimization problem

This page was built for publication: Algorithms with guarantee value for knapsack problems

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