A new approximation algorithm for the knapsack problem
From MaRDI portal
Recommendations
- A new approximate algorithm for the knapsack problem
- The fully polynomial approximation algorithm for the 0-1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- scientific article; zbMATH DE number 1182767
Cited in
(26)- An approximation algorithm for solving unconstrained two-dimensional knapsack problems
- A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
- A new fully polynomial time approximation scheme for the Knapsack problem
- Simple but efficient approaches for the collapsing knapsack problem
- Approximation algorithms for knapsack problems with cardinality constraints
- New exact approaches and approximation results for the penalized knapsack problem
- Approximating the 3-period incremental knapsack problem
- Approximation algorithms for a two-phase knapsack problem
- Approximate minimization algorithms for the 0/1 knapsack and subset-sum problem
- Improved approximation algorithms for a bilevel knapsack problem
- On approximating the incremental knapsack problem
- Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- A new approximate algorithm for the knapsack problem
- Realization of knapsack problem solving algorithm and some of its applications
- A New Knapsack Solution Approach by Integer Equivalent Aggregation and Consistency Determination
- scientific article; zbMATH DE number 1182767 (Why is no real title available?)
- scientific article; zbMATH DE number 2059840 (Why is no real title available?)
- A New Algorithm for the Solution of the Knapsack Problem
- A Stability Concept For Zero-One Knapsack Problems And Approximation Algorithms
- Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
- scientific article; zbMATH DE number 1408349 (Why is no real title available?)
- An addendum to: ``Some thoughts on the 2-approximation algorithm for knapsack problems: a survey
- Approximation Algorithms for a Bi-level Knapsack Problem
- A 2-APPROXIMATION ALGORITHM FOR THE MINIMUM KNAPSACK PROBLEM WITH A FORCING GRAPH
- Reoptimizing the 0-1 knapsack problem
- The fully polynomial approximation algorithm for the 0-1 knapsack problem
This page was built for publication: A new approximation algorithm for the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5475207)
