Pages that link to "Item:Q4427320"

The following pages link to When Does a Dynamic Programming Formulation Guarantee the Existence of a Fully Polynomial Time Approximation Scheme (FPTAS)? (Q4427320):

Displayed 50 items.

• The focus of attention problem (Q262243) ‎ (← links)
• Two-machine open-shop scheduling with rejection to minimize the makespan (Q280183) ‎ (← links)
• The economic lot-sizing problem with an emission capacity constraint (Q299782) ‎ (← links)
• General approximation schemes for min-max (regret) versions of some (pseudo-)polynomial problems (Q429650) ‎ (← links)
• Toward a model for backtracking and dynamic programming (Q430838) ‎ (← links)
• Bi-criteria scheduling on a single parallel-batch machine (Q437901) ‎ (← links)
• Scheduling a variable maintenance and linear deteriorating jobs on a single machine (Q458380) ‎ (← links)
• Limitations of incremental dynamic programming (Q517805) ‎ (← links)
• A stronger model of dynamic programming algorithms (Q547305) ‎ (← links)
• Scheduling resumable deteriorating jobs on a single machine with non-availability constraints (Q620936) ‎ (← links)
• Evolutionary algorithms and dynamic programming (Q652137) ‎ (← links)
• Parallel-machine scheduling with deteriorating jobs and rejection (Q708217) ‎ (← links)
• Fully polynomial time approximation scheme for the total weighted tardiness minimization with a common due date (Q708332) ‎ (← links)
• Differential approximation schemes for half-product related functions and their scheduling applications (Q729806) ‎ (← links)
• Fully polynomial-time approximation schemes for time-cost tradeoff problems in series-parallel project networks (Q833589) ‎ (← links)
• An improved approximation scheme for scheduling a maintenance and proportional deteriorating jobs (Q898702) ‎ (← links)
• \(\varepsilon \)-optimization schemes and \(L\)-bit precision: alternative perspectives for solving combinatorial optimization problems (Q951128) ‎ (← links)
• Fully polynomial approximation schemes for a symmetric quadratic knapsack problem and its scheduling applications (Q973008) ‎ (← links)
• A comment on parallel-machine scheduling under a grade of service provision to minimize makespan (Q976111) ‎ (← links)
• ``Product partition'' and related problems of scheduling and systems reliability: computational complexity and approximation (Q992654) ‎ (← links)
• Approximation algorithms for single machine scheduling with one unavailability period (Q1022445) ‎ (← links)
• Weighted sum coloring in batch scheduling of conflicting jobs (Q1031871) ‎ (← links)
• The single-machine total tardiness scheduling problem: review and extensions (Q1038369) ‎ (← links)
• Recursive functions on the plane and FPTASs for production planning and scheduling problems with two facilities (Q1040690) ‎ (← links)
• Equivalent time-dependent scheduling problems (Q1041934) ‎ (← links)
• A FPTAS for minimizing total completion time in a single machine time-dependent scheduling problem (Q1046099) ‎ (← links)
• Complexity and approximability results for slicing floorplan designs. (Q1399599) ‎ (← links)
• Two-agent parallel-machine scheduling with rejection (Q1676363) ‎ (← links)
• Complex-demand scheduling problem with application in smart grid (Q1727389) ‎ (← links)
• Scheduling on parallel machines with preemption and transportation delays (Q1761986) ‎ (← links)
• Minimization of ordered, symmetric half-products (Q1763481) ‎ (← links)
• Approximation of the supply scheduling problem (Q1779701) ‎ (← links)
• An FPTAS for the single-item capacitated economic lot-sizing problem with supply and demand (Q1939682) ‎ (← links)
• Offline black and white bin packing (Q2355707) ‎ (← links)
• Approximation schemes for scheduling a maintenance and linear deteriorating jobs (Q2358862) ‎ (← links)
• Approximating multidimensional subset sum and Minkowski decomposition of polygons (Q2364904) ‎ (← links)
• Complexity and approximability of scheduling resumable proportionally deteriorating jobs (Q2379562) ‎ (← links)
• The finite horizon investor problem with a budget constraint (Q2379989) ‎ (← links)
• Approximation schemes for a class of subset selection problems (Q2381527) ‎ (← links)
• Approximation algorithms for binary packing problems with quadratic constraints of low cp-rank decompositions (Q2399291) ‎ (← links)
• Single-machine scheduling with production and rejection costs to minimize the maximum earliness (Q2410087) ‎ (← links)
• Scheduling with rejection and non-identical job arrivals (Q2425836) ‎ (← links)
• Exponential lower bounds on the complexity of a class of dynamic programs for combinatorial optimization problems (Q2428688) ‎ (← links)
• Scheduling of pipelined operator graphs (Q2434287) ‎ (← links)
• Bounded parallel-batching scheduling with two competing agents (Q2434316) ‎ (← links)
• Scheduling and packing malleable and parallel tasks with precedence constraints of bounded width (Q2436669) ‎ (← links)
• Bin covering with cardinality constraints (Q2446840) ‎ (← links)
• An FPTAS for a single-item capacitated economic lot-sizing problem with monotone cost structure (Q2492672) ‎ (← links)
• A comment on scheduling two parallel machines with capacity constraints (Q2581321) ‎ (← links)
• Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) ‎ (← links)