Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2107164 (Why is no real title available?)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
- Approximate Algorithms for the 0/1 Knapsack Problem
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
- On the facets of the mixed-integer knapsack polyhedron
- The 0-1 knapsack problem with a single continuous variable
Cited in
(5)- Exact algorithm for solving knapsack problem with a single continuous variable
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses
- A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- An exact algorithm for the 0-1 linear knapsack problem with a single continuous variable
This page was built for publication: Approximation algorithms on 0--1 linear knapsack problem with a single continuous variable
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q489742)