Local minima for indefinite quadratic knapsack problems
From MaRDI portal
Publication:1186274
DOI10.1007/BF01586048zbMath0751.90058OpenAlexW2058731530MaRDI QIDQ1186274
Publication date: 28 June 1992
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01586048
Abstract computational complexity for mathematical programming problems (90C60) 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, An efficient global algorithm for a class of indefinite separable quadratic programs, Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, Minimization of a strictly convex separable function subject to convex separable inequality constraint and box constraints, Approximation algorithms for indefinite quadratic programming, Inverse optimization for linearly constrained convex separable programming problems, Algorithms for the solution of quadratic knapsack problems
Cites Work
- An O(n) algorithm for quadratic knapsack problems
- Visibility and intersection problems in plane geometry
- An algorithm for a singly constrained class of quadratic programs subject upper and lower bounds
- How easy is local search?
- On the solution of concave knapsack problems
- On Finding and Verifying Locally Optimal Solutions
- A lagrangean relaxation algorithm for the constrained matrix problem
- Some NP-complete problems in quadratic and nonlinear programming
- Quasi-Newton Updates with Bounds
- A polynomially bounded algorithm for a singly constrained quadratic program
- Disaggregation and Resource Allocation Using Convex Knapsack Problems with Bounded Variables
- A branch and bound algorithm for the maximum clique problem
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
