Pages that link to "Item:Q1304384"

The following pages link to A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384):

Displaying 35 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)
• Reoptimizing the 0-1 knapsack problem (Q608266) (← links)
• There is no EPTAS for two-dimensional knapsack (Q765522) (← links)
• A problem reduction based approach to discrete optimization algorithm design (Q975314) (← links)
• A successive approximation algorithm for the multiple knapsack problem (Q1029265) (← 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 algorithms for knapsack problems with cardinality constraints (Q1569936) (← links)
• Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
• A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574) (← links)
• A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
• Computing knapsack solutions with cardinality robustness (Q1926647) (← 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)
• Exploring search space trees using an adapted version of Monte Carlo tree search for combinatorial optimization problems (Q2108169) (← links)
• An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
• Multistage knapsack (Q2119404) (← links)
• A new class of hard problem instances for the 0-1 knapsack problem (Q2140267) (← links)
• Order acceptance and scheduling with machine availability constraints (Q2255964) (← links)
• An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
• Knapsack problem with objective value gaps (Q2361124) (← links)
• An FPTAS for the parametric knapsack problem (Q2361499) (← links)
• On a resource-constrained scheduling problem with application to distributed systems reconfiguration (Q2371345) (← links)
• Two-machine shop scheduling: Compromise between flexibility and makespan value (Q2566711) (← links)
• Approximability of Two Variants of Multiple Knapsack Problems (Q2947034) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• A Polynomial-Time Approximation Scheme for Sequential Batch Testing of Series Systems (Q5080670) (← links)
• (Q5091235) (← links)
• (Q5092381) (← links)
• (Q5240419) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• Learning-augmented algorithms for online subset sum (Q6064057) (← links)
• Combinatorial algorithms for solving the constrained knapsack problems with divisible item sizes and penalties (Q6081604) (← links)