Pages that link to "Item:Q1400576"

The following pages link to An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576):

Displaying 25 items.

• Single machine scheduling with semi-resumable machine availability constraints (Q655762) (← links)
• Priority algorithms for the subset-sum problem (Q1029701) (← 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)
• Robust single machine scheduling with a flexible maintenance activity (Q1738814) (← links)
• Scheduling with time-of-use costs (Q1755384) (← links)
• Exact and approximation algorithms for geometric and capacitated set cover problems (Q1759660) (← links)
• Optimal parallel machines scheduling with availability constraints (Q1775061) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Preemptive scheduling on two identical parallel machines with a single transporter (Q1944394) (← links)
• Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
• Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
• Approximation schemes for scheduling on a single machine subject to cumulative deterioration and maintenance (Q2434334) (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
• Some complexity and approximation results for coupled-tasks scheduling problem according to topology (Q2954345) (← links)
• ONLINE AND SEMI-ONLINE SCHEDULING ON CAPACITATED TWO-PARALLEL MACHINES (Q2998841) (← links)
• Coupled-Tasks in Presence of Bipartite Compatibilities Graphs (Q3195325) (← links)
• Solving Medium-Density Subset Sum Problems in Expected Polynomial Time: An Enumeration Approach (Q3507347) (← links)
• A Survey on Approximation Algorithms for Scheduling with Machine Unavailability (Q3637311) (← links)
• (Q5091235) (← links)
• (Q5240419) (← links)
• Approximation algorithms for scheduling with reservations (Q5961975) (← links)
• An FPTAS for scheduling with resource constraints (Q6047696) (← links)
• Learning-augmented algorithms for online subset sum (Q6064057) (← links)