Pages that link to "Item:Q1194858"
From MaRDI portal
The following pages link to On the continuous quadratic knapsack problem (Q1194858):
Displaying 36 items.
- 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)
- Fast algorithm for singly linearly constrained quadratic programs with box-like constraints (Q513719) (← links)
- A note on optimal solutions to quadratic knapsack problems (Q614202) (← links)
- A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems (Q623462) (← links)
- Simple solution methods for separable mixed linear and quadratic knapsack problem (Q693416) (← links)
- An O(n) algorithm for quadratic knapsack problems (Q797501) (← links)
- A Newton's method for the continuous quadratic knapsack problem (Q892383) (← links)
- Variable fixing algorithms for the continuous quadratic Knapsack problem (Q927220) (← links)
- A unified method for a class of convex separable nonlinear knapsack problems (Q930930) (← links)
- Inverse optimization for linearly constrained convex separable programming problems (Q1044084) (← links)
- An algorithm for the continuous variable upper bound knapsack problem (Q1108930) (← links)
- Quadratic resource allocation with generalized upper bounds (Q1376263) (← links)
- The nonlinear knapsack problem - algorithms and applications (Q1600928) (← links)
- Nonlinear integer programming for optimal allocation in stratified sampling (Q1610189) (← links)
- Solving the continuous nonlinear resource allocation problem with an interior point method (Q1785268) (← links)
- The continuous knapsack problem with capacities (Q2059181) (← links)
- Variable fixing method by weighted average for the continuous quadratic knapsack problem (Q2074624) (← links)
- A library for continuous convex separable quadratic knapsack problems (Q2355800) (← links)
- Quadratic bottleneck knapsack problems (Q2359152) (← links)
- Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time (Q2364490) (← 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)
- A relaxed projection method for general integer quadratic knapsack problem. (Q2477123) (← links)
- A sequential method for a class of box constrained quadratic programming problems (Q2483014) (← links)
- A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems (Q2575248) (← links)
- A penalty algorithm for solving convex separable knapsack problems (Q2660092) (← links)
- (Q3134089) (← links)
- Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints (Q3559429) (← links)
- A Projection Method for the Integer Quadratic Knapsack Problem (Q4887719) (← links)
- A two-phase method for solving continuous rank-one quadratic knapsack problems (Q5054022) (← links)
- Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian (Q5077165) (← links)
- An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem (Q5270754) (← links)
- A pegging algorithm for the nonlinear resource allocation problem (Q5959400) (← links)
- On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex (Q5963696) (← links)
