Pages that link to "Item:Q2284640"
From MaRDI portal
The following pages link to Bi-criteria path problem with minimum length and maximum survival probability (Q2284640):
Displaying 7 items.
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Approximating the product knapsack problem (Q2230782) (← links)
- A fully polynomial time approximation scheme for the probability maximizing shortest path problem (Q2670558) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)
