An O(n) algorithm for quadratic knapsack problems
From MaRDI portal
(Redirected from Publication:797501)
Recommendations
Cites work
Cited in
(82)- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints
- A fast algorithm for quadratic resource allocation problems with nested constraints
- Sparse regularization via bidualization
- Complexity estimation for an algorithm of searching for zero of a piecewise linear convex function
- A Bregman–Kaczmarz method for nonlinear systems of equations
- Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm
- scientific article; zbMATH DE number 7255066 (Why is no real title available?)
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems
- Estimating networks with jumps
- Minimum variance allocation among constrained intervals
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian
- Fast algorithm for the quadratic knapsack problem
- Total variation regularization strategies in full-waveform inversion
- Computing ground states of Bose-Einstein condensates with higher order interaction via a regularized density function formulation
- A direct algorithm of separable quadratic knapsack problem
- Comparative study of two fast algorithms for projecting a point to the standard simplex
- A fast algorithm for solving a simple search problem
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- Breakpoint searching algorithms for the continuous quadratic knapsack problem
- On linear-time algorithms for the continuous quadratic Knapsack problem
- Conditional subgradient optimization -- theory and applications
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications
- An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\)
- Variable fixing algorithms for the continuous quadratic Knapsack problem
- An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program
- Alternating direction method of multipliers for sparse principal component analysis
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows
- A sequential method for a class of box constrained quadratic programming problems
- Inverse optimization for linearly constrained convex separable programming problems
- A Closed-Form Solution To A Class Of Quadratic Knapsack Problems
- Algorithms for the solution of quadratic knapsack problems
- Evasive path planning under surveillance uncertainty
- Approximation algorithms for indefinite quadratic programming
- A pegging algorithm for the nonlinear resource allocation problem
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds
- A penalty algorithm for solving convex separable knapsack problems
- Issues in the implementation of the DSD algorithm for the traffic assignment problem
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints
- A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training
- Quadratic bottleneck knapsack problems
- Solving the continuous nonlinear resource allocation problem with an interior point method
- Linear time algorithms for some separable quadratic programming problems
- A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines
- A breakpoint search approach for convex resource allocation problems with bounded variables
- Using quadratic programming to solve high multiplicity scheduling problems on parallel machines
- Complexity and algorithms for nonlinear optimization problems
- A note on optimal solutions to quadratic knapsack problems
- The quadratic knapsack problem -- a survey
- On a discrete nonlinear and nonseparable knapsack problem
- A survey on the continuous nonlinear resource allocation problem
- Local minima for indefinite quadratic knapsack problems
- A two-phase method for solving continuous rank-one quadratic knapsack problems
- An efficient hybrid algorithm for the separable convex quadratic knapsack problem
- A nonlinear knapsack problem
- A Benders decomposition based heuristic for the hierarchical production planning problem
- A dual method for minimizing a nonsmooth objective over one smooth inequality constraint
- Variable fixing method by weighted average for the continuous quadratic knapsack problem
- On the continuous quadratic knapsack problem
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints
- Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies
- On the solution of multidimensional convex separable continuous knapsack problem with bounded variables
- Simple solution methods for separable mixed linear and quadratic knapsack problem
- Maximum likelihood estimation of cell probabilities in constrained multinomial models
- Linear programming with variable matrix entries
- Decision model and analysis for investment interest expense deduction and allocation
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- A Newton's method for the continuous quadratic knapsack problem
- The symmetric quadratic knapsack problem: approximation and scheduling applications
- Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization
- Solving the unit commitment problem by a unit decommitment method
- Quadratic resource allocation with generalized upper bounds
- Finding the projection onto the intersection of a closed half-space and a variable box
- On the solution of concave knapsack problems
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems
- On a Reduction for a Class of Resource Allocation Problems
- Algorithms for bound constrained quadratic programming problems
- The quadratic 0-1 knapsack problem with series-parallel support
- Level-set methods for convex optimization
- A decomposition algorithm for nested resource allocation problems
- The nonlinear knapsack problem - algorithms and applications
- Efficient nonconvex sparse group feature selection via continuous and discrete optimization
This page was built for publication: An O(n) algorithm for quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q797501)
