Pages that link to "Item:Q930930"
From MaRDI portal
The following pages link to A unified method for a class of convex separable nonlinear knapsack problems (Q930930):
Displaying 9 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints (Q439517) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- Heuristic algorithms for the general nonlinear separable knapsack problem (Q709196) (← links)
- Multi-product newsboy problem with limited capacity and outsourcing (Q1038384) (← links)
- Relaxations and heuristics for the multiple non-linear separable knapsack problem (Q1652581) (← links)
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) (Q1761954) (← links)
- Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
