Pages that link to "Item:Q4427320"
From MaRDI portal
The following pages link to When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320):
Displaying 20 items.
- Approximation Scheme for Scheduling Resumable Proportionally Deteriorating Jobs (Q3004654) (← links)
- A note on dual approximation algorithms for class constrained bin packing problems (Q3625691) (← links)
- POLYNOMIAL APPROXIMATION SCHEMES FOR THE MAX-MIN ALLOCATION PROBLEM UNDER A GRADE OF SERVICE PROVISION (Q3646206) (← links)
- Strongly Fully Polynomial Time Approximation Scheme for the weighted completion time minimization problem on two-parallel capacitated machines (Q4578168) (← links)
- TWO APPROXIMATION SCHEMES FOR SCHEDULING ON PARALLEL MACHINES UNDER A GRADE OF SERVICE PROVISION (Q4649879) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Packing Under Convex Quadratic Constraints (Q5041751) (← links)
- Fully polynomial-time approximation scheme for single machine scheduling with proportional-linear deteriorating jobs (Q5059255) (← links)
- An FPTAS of minimizing total weighted completion time on single machine with position constraint (Q5136235) (← links)
- Production and Transportation Integration for Commit-to-Delivery Mode with General Shipping Costs (Q5148187) (← links)
- Provably Near-Optimal Approximation Schemes for Implicit Stochastic and Sample-Based Dynamic Programs (Q5148198) (← links)
- The subset sum game revisited (Q5918370) (← links)
- An EPTAS for scheduling on unrelated machines of few different types (Q5919620) (← links)
- Approximation algorithms for scheduling with reservations (Q5961975) (← links)
- Bi-Criteria Approximation Algorithms for Load Balancing on Unrelated Machines with Costs (Q6065410) (← links)
- Pareto‐scheduling with double‐weighted jobs to minimize the weighted number of tardy jobs and total weighted late work (Q6077487) (← links)
- Two-agent single-machine scheduling with release dates to minimize the makespan (Q6081603) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
- Approximation scheme for single-machine rescheduling with job delay and rejection (Q6167004) (← links)
- Single machine scheduling with assignable due dates to minimize maximum and total late work (Q6167395) (← links)