Pages that link to "Item:Q797501"
From MaRDI portal
The following pages link to An O(n) algorithm for quadratic knapsack problems (Q797501):
Displaying 31 items.
- 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)
- Complexity and algorithms for nonlinear optimization problems (Q2480263) (← links)
- Convergent Lagrangian heuristics for nonlinear minimum cost network flows (Q2480971) (← links)
- A sequential method for a class of box constrained quadratic programming problems (Q2483014) (← links)
- Linear programming with variable matrix entries (Q2488219) (← links)
- New algorithms for singly linearly constrained quadratic programs subject to lower and upper bounds (Q2492668) (← links)
- Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications (Q2630817) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- A fast algorithm for quadratic resource allocation problems with nested constraints (Q2669547) (← links)
- Fast algorithm for the quadratic knapsack problem (Q2674729) (← links)
- A decomposition algorithm for nested resource allocation problems (Q2810553) (← links)
- Comparative study of two fast algorithms for projecting a point to the standard simplex (Q3186866) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- IMPROVED PROJECTED GRADIENT ALGORITHMS FOR SINGLY LINEARLY CONSTRAINED QUADRATIC PROGRAMS SUBJECT TO LOWER AND UPPER BOUNDS (Q3560109) (← links)
- Maximum likelihood estimation of cell probabilities in constrained multinomial models (Q4253300) (← links)
- Complexity Estimation for an Algorithm of Searching for Zero of a Piecewise Linear Convex Function (Q4558290) (← links)
- Total Variation Regularization Strategies in Full-Waveform Inversion (Q4686921) (← links)
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems (Q4835455) (← links)
- (Q4969074) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
- Using Nemirovski's Mirror-Prox method as basic procedure in Chubanov's method for solving homogeneous feasibility problems (Q5058382) (← links)
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
- A New Combinatorial Algorithm for Separable Convex Resource Allocation with Nested Bound Constraints (Q5085487) (← links)
- On a Reduction for a Class of Resource Allocation Problems (Q5087712) (← links)
- Computing Ground States of Bose--Einstein Condensates with Higher Order Interaction via a Regularized Density Function Formulation (Q5204005) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- A direct algorithm of separable quadratic knapsack problem (Q5499413) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
- A Bregman–Kaczmarz method for nonlinear systems of equations (Q6492445) (← links)
