Pages that link to "Item:Q1768594"
From MaRDI portal
The following pages link to Improved dynamic programming in connection with an FPTAS for the knapsack problem (Q1768594):
Displaying 29 items.
- Exact solution of the robust knapsack problem (Q336592) (← links)
- Minimum and worst-case performance ratios of rollout algorithms (Q415370) (← links)
- Reductions between scheduling problems with non-renewable resources and knapsack problems (Q482287) (← links)
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
- Fast approximation algorithms to minimize a special weighted flow-time criterion on a single machine with a non-availability interval and release dates (Q640300) (← links)
- Communication scheduling in data gathering networks of heterogeneous sensors with data compression: algorithms and empirical experiments (Q724122) (← links)
- There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
- Two simple constant ratio approximation algorithms for minimizing the total weighted completion time on a single machine with a fixed non-availability interval (Q1042105) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Algorithms for communication scheduling in data gathering network with data compression (Q1755733) (← links)
- The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
- Solutions for subset sum problems with special digraph constraints (Q2216192) (← links)
- Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Algorithms for the bounded set-up knapsack problem (Q2467131) (← links)
- (Q5091235) (← links)
- (Q5240419) (← links)
- Structured \((\min ,+)\)-convolution and its applications for the shortest/closest vector and nonlinear knapsack problems (Q6181364) (← links)
