Some thoughts on the 2-approximation algorithm for knapsack problems: a survey

MaRDI QIDQ2932049zbMATH OpenFDO

Authors Hiroshi Iida

Publication date 28 November 2014

Full work available at URL http://www.pphmj.com/abstract/8615.htm

zbMATH Keywords

2-approximation algorithmcombinatorial optimizationknapsack problem

Mathematics Subject Classification ID

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

Recommendations

• An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
• scientific article; zbMATH DE number 3989108
• A new approximation algorithm for the knapsack problem
• A new approximate algorithm for the knapsack problem
• scientific article; zbMATH DE number 3847214

Cited in

(8)

• An approximation algorithm for solving unconstrained two-dimensional knapsack problems
• Approximation algorithms for a two-phase knapsack problem
• On the rectangular knapsack problem
• A new approximate algorithm for the knapsack problem
• Faster Approximation Schemes for the Two-Dimensional Knapsack Problem
• An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
• A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
• A new approximation algorithm for the knapsack problem

This page was built for publication: Some thoughts on the 2-approximation algorithm for knapsack problems: a survey

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