On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
From MaRDI portal
Recommendations
- On a nonseparable convex maximization problem with continuous Knapsack constraints
- A continuous knapsack problem with separable convex utilities: approximation algorithms and applications
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- A unified method for a class of convex separable nonlinear knapsack problems
- On separating cover inequalities for the multidimensional knapsack problem
- Sac à dos multidimensionnel en variables 0-1 : encadrement de la somme des variables à l'optimum
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- A scheme for exact separation of extended cover inequalities and application to multidimensional knapsack problems
- An Efficient Method for a Class of Continuous Nonlinear Knapsack Problems
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
Cites work
- scientific article; zbMATH DE number 2033405 (Why is no real title available?)
- scientific article; zbMATH DE number 2146951 (Why is no real title available?)
- A Lagrangian dual method for solving variational inequalities
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
- A polynomially bounded algorithm for a singly constrained quadratic program
- Algorithms for bound constrained quadratic programming problems
- Algorithms for the solution of quadratic knapsack problems
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- An efficient method for minimizing a convex separable logarithmic function subject to a convex inequality constraint or linear equality constraint
- Convex quadratic programming with one constraint and bounded variables
- Convex separable minimization subject to bounded variables
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Method for solving a convex integer programming problem
- Minimization of a convex linear-fractional separable function subject to a convex inequality constraint or linear inequality constraint and bounds on the variables
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- On the application of iterative methods of nondifferentiable optimization to some problems of approximation theory
- On the continuous quadratic knapsack problem
- On the solution of concave knapsack problems
- On the solution of variational inequality problems by using cutting plane methods
- Polynomial algorithms for projecting a point onto a region defined by a linear constraint and box constraints in \(\mathbb{R}^n\)
- Simple Ranking Methods for Allocation of One Resource
- Solution of some convex separable resource allocation and production planning problems with bounds on the variables
- Surrogate upper bound sets for bi-objective bi-dimensional binary knapsack problems
- Technical Note—Allocation of Effort Resources among Competing Activities
- The theory of search: optimum distribution of search effort
- Valid inequalities and cutting planes for some polytopes
- Valid inequalities, cutting planes and integrality of the knapsack polytope
- Validation of subgradient optimization
- Well-posedness and primal-dual analysis of some convex separable optimization problems
Cited in
(8)- Separable optimization. Theory and methods
- On separating cover inequalities for the multidimensional knapsack problem
- Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls
- On the solution of special generalized upper-bounded problems: The LP/GUB knapsack problem and the λ-form separable convex objective function problem
- An Affine-Scaling Interior-Point Method for Continuous Knapsack Constraints with Application to Support Vector Machines
- Knapsack problems -- an overview of recent advances. II: Multiple, multidimensional, and quadratic knapsack problems
- A fragile multi-CPR game
- On a nonseparable convex maximization problem with continuous Knapsack constraints
This page was built for publication: On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q319990)
