Pages that link to "Item:Q2480263"
From MaRDI portal
The following pages link to Complexity and algorithms for nonlinear optimization problems (Q2480263):
Displaying 4 items.
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- A faster algorithm for the resource allocation problem with convex cost functions (Q491166) (← links)
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints (Q1651695) (← links)
- Optimal procurement and production planning for multi-product multi-stage production under yield uncertainty (Q1713747) (← links)
