A unified method for a class of convex separable nonlinear knapsack problems
From MaRDI portal
Publication:930930
DOI10.1016/j.ejor.2007.07.005zbMath1146.90051OpenAlexW1972011204MaRDI QIDQ930930
Publication date: 24 June 2008
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2007.07.005
Related Items (9)
Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Relaxations and heuristics for the multiple non-linear separable knapsack problem ⋮ Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints ⋮ HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM ⋮ Simple solution methods for separable mixed linear and quadratic knapsack problem ⋮ A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP) ⋮ Capacity-constrained multiple-market price discrimination ⋮ Heuristic algorithms for the general nonlinear separable knapsack problem ⋮ Multi-product newsboy problem with limited capacity and outsourcing
Cites Work
- Unnamed Item
- Algorithms for bound constrained quadratic programming problems
- On the continuous quadratic knapsack problem
- The nonlinear knapsack problem - algorithms and applications
- Nonlinear integer programming for optimal allocation in stratified sampling
- A variable-grouping based genetic algorithm for large-scale integer programming
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Algorithms for Separable Nonlinear Resource Allocation Problems
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- Simple Ranking Methods for Allocation of One Resource
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Technical Note—Allocation of Effort Resources among Competing Activities
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- The Nonlinear Resource Allocation Problem
- Convex separable minimization subject to bounded variables
- A pegging algorithm for the nonlinear resource allocation problem
This page was built for publication: A unified method for a class of convex separable nonlinear knapsack problems
