Pages that link to "Item:Q2356258"
From MaRDI portal
The following pages link to Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization (Q2356258):
Displaying 6 items.
- A new effective dynamic program for an investment optimization problem (Q505320) (← links)
- An efficient topology description function method based on modified sigmoid function (Q1720795) (← links)
- Optimal spares allocation to an exchangeable-item repair system with tolerable wait (Q1753605) (← links)
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications (Q1785255) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Continuous equality knapsack with probit-style objectives (Q6614696) (← links)