Pages that link to "Item:Q797501"

The following pages link to An O(n) algorithm for quadratic knapsack problems (Q797501):

Displaying 50 items.

• A dual method for minimizing a nonsmooth objective over one smooth inequality constraint (Q312667) (← links)
• Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies (Q319183) (← links)
• On the solution of multidimensional convex separable continuous knapsack problem with bounded variables (Q319990) (← links)
• Alternating direction method of multipliers for sparse principal component analysis (Q457552) (← links)
• Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
• A Benders decomposition based heuristic for the hierarchical production planning problem (Q584066) (← links)
• A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
• Using quadratic programming to solve high multiplicity scheduling problems on parallel machines (Q675305) (← links)
• Approximation algorithms for indefinite quadratic programming (Q687094) (← links)
• Linear time algorithms for some separable quadratic programming problems (Q688207) (← links)
• A breakpoint search approach for convex resource allocation problems with bounded variables (Q691476) (← links)
• Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
• A coordinate gradient descent method for linearly constrained smooth optimization and support vector machines training (Q711381) (← links)
• Evasive path planning under surveillance uncertainty (Q778086) (← links)
• Algorithms for the solution of quadratic knapsack problems (Q806968) (← links)
• The quadratic knapsack problem -- a survey (Q875597) (← links)
• Efficient nonconvex sparse group feature selection via continuous and discrete optimization (Q892230) (← links)
• A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
• On a discrete nonlinear and nonseparable knapsack problem (Q920849) (← links)
• An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds (Q922953) (← links)
• Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
• Block-coordinate gradient descent method for linearly constrained nonsmooth separable optimization (Q1016411) (← links)
• Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
• Algorithms for bound constrained quadratic programming problems (Q1122320) (← links)
• Local minima for indefinite quadratic knapsack problems (Q1186274) (← links)
• On the continuous quadratic knapsack problem (Q1194858) (← links)
• Conditional subgradient optimization -- theory and applications (Q1266608) (← links)
• An \(O(n^ 2)\) active set method for solving a certain parametric quadratic program (Q1321144) (← links)
• Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
• An \(O(n)\) algorithm for projecting a vector on the intersection of a hyperplane and a box in \(\mathbb R^n\) (Q1411525) (← links)
• Solving the unit commitment problem by a unit decommitment method (Q1586810) (← links)
• The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
• Level-set methods for convex optimization (Q1739042) (← links)
• Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
• A nonlinear knapsack problem (Q1905070) (← links)
• A conjugate gradient method for the unconstrained minimization of strictly convex quadratic splines (Q1919811) (← links)
• The symmetric quadratic knapsack problem: approximation and scheduling applications (Q1936656) (← links)
• Estimating networks with jumps (Q1950892) (← links)
• Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
• Sparse regularization via bidualization (Q2114593) (← links)
• Computational aspects of the inverse single facility location problem on trees under \(l_k\)-norm (Q2205945) (← links)
• On the solution of concave knapsack problems (Q2276878) (← links)
• A fast algorithm for solving a simple search problem (Q2332641) (← links)
• Decision model and analysis for investment interest expense deduction and allocation (Q2379558) (← links)
• Minimum variance allocation among constrained intervals (Q2423792) (← links)
• Issues in the implementation of the DSD algorithm for the traffic assignment problem (Q2433525) (← links)
• Finding the projection onto the intersection of a closed half-space and a variable box (Q2450616) (← links)
• A survey on the continuous nonlinear resource allocation problem (Q2456404) (← links)
• Breakpoint searching algorithms for the continuous quadratic knapsack problem (Q2465658) (← links)
• On linear-time algorithms for the continuous quadratic Knapsack problem (Q2471117) (← links)