A unified method for a class of convex separable nonlinear knapsack problems
From MaRDI portal
Recommendations
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- A Solution Strategy for a Class of Nonlinear Knapsack Problems
- Nonconvex piecewise linear knapsack problems
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- On a discrete nonlinear and nonseparable knapsack problem
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- A penalty algorithm for solving convex separable knapsack problems
Cites work
- scientific article; zbMATH DE number 3216838 (Why is no real title available?)
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Projection Method for the Integer Quadratic Knapsack Problem
- A pegging algorithm for the nonlinear resource allocation problem
- A variable-grouping based genetic algorithm for large-scale integer programming
- Algorithms for bound constrained quadratic programming problems
- Algorithms for separable nonlinear resource allocation problems
- An approximate dynamic programming approach to convex quadratic knapsack problems
- Convex separable minimization subject to bounded variables
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- Lower and Upper Bounds for the Allocation Problem and Other Nonlinear Optimization Problems
- Nonlinear integer programming for optimal allocation in stratified sampling
- On the continuous quadratic knapsack problem
- Simple Ranking Methods for Allocation of One Resource
- Technical Note—Allocation of Effort Resources among Competing Activities
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- The Nonlinear Resource Allocation Problem
- The nonlinear knapsack problem - algorithms and applications
Cited in
(15)- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- A penalty algorithm for solving convex separable knapsack problems
- HEURISTIC AND EXACT SOLUTION METHOD FOR CONVEX NONLINEAR KNAPSACK PROBLEM
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Capacity-constrained multiple-market price discrimination
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Approximation schemes for non-separable non-linear Boolean programming problems under nested knapsack constraints
- Nonconvex piecewise linear knapsack problems
- Multi-tier binary solution method for multi-product newsvendor problem with multiple constraints
- Multi-product newsboy problem with limited capacity and outsourcing
- A heuristic approach for allocation of data to RFID tags: a data allocation knapsack problem (DAKP)
- Heuristic algorithms for the general nonlinear separable knapsack problem
- Exact algorithm for concave knapsack problems: linear underestimation and partition method
- On a nonseparable convex maximization problem with continuous Knapsack constraints
This page was built for publication: A unified method for a class of convex separable nonlinear knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q930930)
