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):
Displayed 50 items.
- Complexity and approximability results for slicing floorplan designs. (Q1399599) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Parallel-machine scheduling with time-dependent and machine availability constraints (Q1667046) (← links)
- Two-agent parallel-machine scheduling with rejection (Q1676363) (← links)
- Scheduling on parallel identical machines with late work criterion: offline and online cases (Q1702733) (← links)
- Multi-machine scheduling with interval constrained position-dependent processing times (Q1716992) (← 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)
- A PTAS for a class of binary non-linear programs with low-rank functions (Q2060337) (← links)
- Single-machine Pareto-scheduling with multiple weighting vectors for minimizing the total weighted late works (Q2083387) (← links)
- Due date assignment and two-agent scheduling under multitasking environment (Q2084604) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Fully polynomial time \((\Sigma,\Pi)\)-approximation schemes for continuous nonlinear newsvendor and continuous stochastic dynamic programs (Q2089771) (← links)
- In memoriam: Gerhard Woeginger (1964--2022) (Q2093179) (← links)
- A classification of dynamic programming formulations for offline deterministic single-machine scheduling problems (Q2102995) (← links)
- Packing under convex quadratic constraints (Q2118134) (← links)
- Single machine scheduling with rejection to minimize the weighted makespan (Q2151365) (← links)
- Online learning for min-max discrete problems (Q2166779) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- The proportionate flow shop total tardiness problem (Q2178064) (← links)
- Parallel-batch scheduling with deterioration and rejection on a single machine (Q2194699) (← links)
- Single-machine scheduling with operator non-availability to minimize total weighted completion time (Q2195317) (← links)
- Structural parameters for scheduling with assignment restrictions (Q2205947) (← links)
- Scheduling on a single machine and parallel machines with batch deliveries and potential disruption (Q2210272) (← links)
- Scheduling jobs with a V-shaped time-dependent processing time (Q2215205) (← links)
- Improved bi-criteria approximation schemes for load balancing on unrelated machines with cost constraints (Q2222091) (← links)
- Scheduling for gathering multitype data with local computations (Q2239981) (← links)
- Approximation schemes for \(r\)-weighted minimization knapsack problems (Q2288864) (← links)
- A review of four decades of time-dependent scheduling: main results, new topics, and open problems (Q2305016) (← links)
- Two-agent scheduling problems with the general position-dependent processing time (Q2333788) (← 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)