On the continuous quadratic knapsack problem
From MaRDI portal
Publication:1194858
DOI10.1007/BF01581193zbMath0762.90061OpenAlexW2034027023MaRDI QIDQ1194858
Publication date: 6 October 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01581193
Convex programming (90C25) Nonlinear programming (90C30) Quadratic programming (90C20) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Tight bounds on indefinite separable singly-constrained quadratic programs in linear-time, 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, Efficient projection onto the intersection of a half-space and a box-like set and its generalized Jacobian, Quadratic resource allocation with generalized upper bounds, A penalty algorithm for solving convex separable knapsack problems, A Newton's method for the continuous quadratic knapsack problem, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, A two-phase method for solving continuous rank-one quadratic knapsack problems, Variable fixing algorithms for the continuous quadratic Knapsack problem, A unified method for a class of convex separable nonlinear knapsack problems, A survey on the continuous nonlinear resource allocation problem, Breakpoint searching algorithms for the continuous quadratic knapsack problem, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, Fast algorithm for singly linearly constrained quadratic programs with box-like constraints, A relaxed projection method for general integer quadratic knapsack problem., Simple solution methods for separable mixed linear and quadratic knapsack problem, A sequential method for a class of box constrained quadratic programming problems, Solving the continuous nonlinear resource allocation problem with an interior point method, A pegging algorithm for the nonlinear resource allocation problem, On the coupled continuous knapsack problems: projection onto the volume constrained Gibbs \(N\)-simplex, Variable fixing method by weighted average for the continuous quadratic knapsack problem, Inverse optimization for linearly constrained convex separable programming problems, A class of mathematical programs with equilibrium constraints: a smooth algorithm and applications to contact problems, The nonlinear knapsack problem - algorithms and applications, An Efficient Hybrid Algorithm for the Separable Convex Quadratic Knapsack Problem, Nonlinear integer programming for optimal allocation in stratified sampling
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- A finite algorithm for finding the projection of a point onto the canonical simplex of \({\mathbb R}^ n\)
- Algorithms for bound constrained quadratic programming problems
- Lagrangian dual coordinatewise maximization algorithm for network transportation problems with quadratic costs
- A lagrangean relaxation algorithm for the constrained matrix problem
- Convex quadratic programming with one constraint and bounded variables
- Technical Note—Computational Comparison among Three Multicommodity Network Flow Algorithms
- A New and Efficient Algorithm for a Class of Portfolio Selection Problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- A Polynomial Time Algorithm for the Resource Allocation Problem with a Convex Objective Function
- Validation of subgradient optimization
- Traffic assignment problem for a general network
