Pages that link to "Item:Q2770087"
From MaRDI portal
The following pages link to Algorithms for Separable Nonlinear Resource Allocation Problems (Q2770087):
Displayed 13 items.
- Exact algorithm for concave knapsack problems: linear underestimation and partition method (Q811881) (← links)
- Using separable programming to solve the multi-product multiple ex-ante constraint newsvendor problem and extensions (Q852959) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Nonconvex piecewise linear knapsack problems (Q948649) (← links)
- Solving knapsack problems with \(S\)-curve return functions (Q958108) (← links)
- The design of optimum component test plans for system reliability (Q959396) (← links)
- Convergent Lagrangian and domain cut method for nonlinear knapsack problems (Q1001200) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- A heuristic algorithm for a chance constrained stochastic program (Q2432880) (← links)
- A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
- Optimum component test plans for phased-mission systems (Q2456421) (← links)
- A branch-and-bound based method for solving monotone optimization problems (Q2501119) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)