Algorithms with guarantee value for knapsack problems

DOI10.1080/02331934.2011.617818zbMath1245.90103OpenAlexW2002467715MaRDI QIDQ2903135

Murat Ersen Berberler, Urfat G. Nuriyev, Fidan Nuriyeva, Asli Guler

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

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

Related Items (1)

A new effective dynamic program for an investment optimization problem

Cites Work

• Unnamed Item
• Unnamed Item
• An exact algorithm for large unbounded knapsack problems
• Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
• Worst-Case Analysis of Heuristic Algorithms
• Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems

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