Pages that link to "Item:Q709196"
From MaRDI portal
The following pages link to Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196):
Displayed 12 items.
- Heuristics for the general multiple non-linear knapsack problem (Q510935) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- On the product knapsack problem (Q1653266) (← links)
- A branch-and-bound based heuristic algorithm for convex multi-objective MINLPs (Q1753510) (← links)
- Special issue on knapsack problems and applications (Q1761935) (← links)
- On speed scaling via integer programming (Q1785426) (← links)
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems (Q2147011) (← links)
- A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments (Q2329497) (← links)
- Lower and upper bounds for the non-linear generalized assignment problem (Q2664280) (← links)
- Initial Shipment Decisions for New Products at Zara (Q3453326) (← links)
- Integer knapsack problems with profit functions of the same value range (Q6054010) (← links)
- Approximating single- and multi-objective nonlinear sum and product knapsack problems (Q6108919) (← links)