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 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)
- Semi-online scheduling on two identical machines with a common due date to maximize total early work (Q827603) (← links)
- Single-machine serial-batch delivery scheduling with two competing agents and due date assignment (Q829197) (← 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)
- 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)
