Pages that link to "Item:Q2566930"
From MaRDI portal
The following pages link to An approximate dynamic programming approach to convex quadratic knapsack problems (Q2566930):
Displaying 12 items.
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Capacity-constrained multiple-market price discrimination (Q1761955) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- Strategic oscillation for the quadratic multiple knapsack problem (Q2450910) (← links)
- A new variable reduction technique for convex integer quadratic programs (Q2472944) (← links)
- A Dynamic Programming Heuristic for the Quadratic Knapsack Problem (Q2967622) (← links)
- An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems (Q3114774) (← links)
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM (Q4649881) (← links)
- A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization (Q5058729) (← links)
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem (Q5741470) (← links)