A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
From MaRDI portal
Recommendations
- A nonlinear knapsack problem
- Heuristic algorithms for the general nonlinear separable knapsack problem
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- The nonlinear knapsack problem - algorithms and applications
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
Cites work
- scientific article; zbMATH DE number 44282 (Why is no real title available?)
- scientific article; zbMATH DE number 544186 (Why is no real title available?)
- A Branch-and-Price Algorithm for the Multiperiod Single-Sourcing Problem
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A comparison of complete global optimization solvers
- A pegging algorithm for the nonlinear resource allocation problem
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- Algorithms for the solution of quadratic knapsack problems
- An Algorithm for Large Zero-One Knapsack Problems
- An Efficient Algorithm for the 0-1 Knapsack Problem
- An O(n) algorithm for quadratic knapsack problems
- An O(n) algorithm for the linear multiple choice knapsack problem and related problems
- An O(n) algorithm for the multiple-choice knapsack linear program
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An optimization algorithm for a penalized knapsack problem
- An upper bound for the zero-one knapsack problem and a branch and bound algorithm
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Computing Partitions with Applications to the Knapsack Problem
- Convex quadratic programming with one constraint and bounded variables
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Economic ordering decisions with market choice flexibility
- Exact Solution of the Quadratic Knapsack Problem
- On a discrete nonlinear and nonseparable knapsack problem
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- On the continuous quadratic knapsack problem
- On the solution of concave knapsack problems
- Quadratic knapsack problems
- Simplex-inspired algorithms for solving a class of convex programming problems
- Target market selection and marketing effort under uncertainty: the selective newsvendor
- The Multiple-Choice Knapsack Problem
- The Nonlinear Resource Allocation Problem
- The continuous-time single-sourcing problem with capacity expansion opportunities
- The nonlinear knapsack problem - algorithms and applications
- Warehouse-Retailer Network Design Problem
Cited in
(19)- On a discrete nonlinear and nonseparable knapsack problem
- Relaxations and heuristics for the multiple non-linear separable knapsack problem
- The newsvendor problem with capacitated suppliers and quantity discounts
- Fixed-charge continuous knapsack problems and pseudogreedy solutions
- A nonlinear knapsack problem
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- A Time–Cost Tradeoff Problem with Multiple Assessments and Release Times on a Chain Precedence Graph
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Continuous equality knapsack with probit-style objectives
- Exact solution of a class of nonlinear knapsack problems
- A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning
- A unified method for a class of convex separable nonlinear knapsack problems
- Nonconvex piecewise linear knapsack problems
- Simplex-inspired algorithms for solving a class of convex programming problems
- Integrated market selection and production planning: complexity and solution approaches
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- A normal fan projection algorithm for low-rank optimization
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- On a Reduction for a Class of Resource Allocation Problems
This page was built for publication: A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q623462)
