Pages that link to "Item:Q3115910"
From MaRDI portal
The following pages link to Discrete Dynamic Programming and Capital Allocation (Q3115910):
Displaying 9 items.
- A minimal algorithm for the Bounded Knapsack Problem (Q5101408) (← links)
- Improved smoothed analysis of multiobjective optimization (Q5415491) (← links)
- (Q5743441) (← links)
- Statistical mechanics analysis of generalized multi-dimensional knapsack problems (Q5870449) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)
- The smoothed number of Pareto-optimal solutions in bicriteria integer optimization (Q6044982) (← links)
- Optimization of multilevel investments using dynamic programming based on fuzzy cash flows (Q6483638) (← links)
- The NP-hard problem of computing the maximal sample variance over interval data is solvable in almost linear time with a high probability (Q6599765) (← links)
- Branch-and-bound and dynamic programming approaches for the knapsack problem (Q6633256) (← links)