Improved dynamic programming in connection with an FPTAS for the knapsack problem
From MaRDI portal
Recommendations
Cited in
(35)- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval
- An efficient fully polynomial approximation scheme for the Subset-Sum problem.
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Algorithms for communication scheduling in data gathering network with data compression
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- An approximation algorithm for a general class of multi-parametric optimization problems
- Strongly polynomial FPTASes for monotone dynamic programs
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems
- Approximation schemes for multiperiod binary knapsack problems
- An FPTAS for the -modular multidimensional knapsack problem
- A new class of hard problem instances for the 0-1 knapsack problem
- Solutions for subset sum problems with special digraph constraints
- Order acceptance and scheduling with machine availability constraints
- An FPTAS for the knapsack problem with parametric weights
- An FPTAS for the parametric knapsack problem
- On approximating the incremental knapsack problem
- Algorithms for the bounded set-up knapsack problem
- Exact solution of the robust knapsack problem
- Minimum and worst-case performance ratios of rollout algorithms
- Reductions between scheduling problems with non-renewable resources and knapsack problems
- A new effective dynamic program for an investment optimization problem
- scientific article; zbMATH DE number 7561569 (Why is no real title available?)
- scientific article; zbMATH DE number 7122316 (Why is no real title available?)
- A faster FPTAS for knapsack problem with cardinality constraint
- Reoptimizing the 0-1 knapsack problem
- Structured ( ,+)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates
- No polynomial kernels for knapsack
- Average sensitivity of the knapsack problem
- Online unbounded knapsack
- Knapsack and subset sum with small items
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments
- Even faster knapsack via rectangular monotone min-plus convolution and balancing
- Weakly approximating knapsack in subquadratic time
- There is no EPTAS for two-dimensional knapsack
This page was built for publication: Improved dynamic programming in connection with an FPTAS for the knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768594)
