Variable fixing algorithms for the continuous quadratic Knapsack problem
From MaRDI portal
Recommendations
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- On the continuous quadratic knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- An algorithm for the continuous variable upper bound knapsack problem
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Algorithms for the solution of quadratic knapsack problems
- Solving the generalized knapsack problem with variable coefficients
- A Newton's method for the continuous quadratic knapsack problem
- A semidefinite programming approach to the quadratic knapsack problem
- scientific article; zbMATH DE number 6836465
Cites work
- scientific article; zbMATH DE number 3830713 (Why is no real title available?)
- scientific article; zbMATH DE number 3668345 (Why is no real title available?)
- A $O(n)$ algorithm for projecting a vector on the intersection of a hyperplane and $R^n_+$
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Parallel Projection for the Multicommodity Network Model
- A Projection Method for the Integer Quadratic Knapsack Problem
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- A lagrangean relaxation algorithm for the constrained matrix problem
- A linear-time median-finding algorithm for projecting a vector on the simplex of \({\mathbb{R}}^ n\)
- A polynomially bounded algorithm for a singly constrained quadratic program
- About strongly polynomial time algorithms for quadratic optimization over submodular constraints
- An O(n) algorithm for quadratic knapsack problems
- An O(n) algorithm for projecting a vector on the intersection of a hyperplane and a box in R^n
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Computational development of a lagrangian dual approach for quadratic networks
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- Massively Parallel Algorithms for Singly Constrained Convex Programs
- On Floyd and Rivest's SELECT algorithm
- On linear-time algorithms for the continuous quadratic Knapsack problem
- On the continuous quadratic knapsack problem
- Quadratic resource allocation with generalized upper bounds
- Quasi-Newton Updates with Bounds
- Strongly Polynomial Algorithms for the Quadratic Transportation Problem with a Fixed Number of Sources
- Technical Note—Allocation of Effort Resources among Competing Activities
- Validation of subgradient optimization
Cited in
(17)- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- A penalty algorithm for solving convex separable knapsack problems
- Fast projection onto the simplex and the l₁ ball
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- Modular proximal optimization for multidimensional total-variation regularization
- A Newton's method for the continuous quadratic knapsack problem
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex
- Augmented Lagrangian algorithms for solving the continuous nonlinear resource allocation problem
- Solving nested-constraint resource allocation problems with an interior point method
- Top-\(k\) multi-class SVM using multiple features
- An optimal algorithm for variable knockout problems
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- Minimum variance allocation among constrained intervals
- Multimaterial topology optimization by volume constrained Allen-Cahn system and regularized projected steepest descent method
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- On a Reduction for a Class of Resource Allocation Problems
This page was built for publication: Variable fixing algorithms for the continuous quadratic Knapsack problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q927220)
