Pages that link to "Item:Q1651695"
From MaRDI portal
The following pages link to Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695):
Displayed 4 items.
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- A technical note: fully polynomial time approximation schemes for minimizing the makespan of deteriorating jobs with nonlinear processing times (Q2215197) (← links)
- Bi-criteria path problem with minimum length and maximum survival probability (Q2284640) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)