On the solution of concave knapsack problems
From MaRDI portal
Publication:2276878
DOI10.1007/BF01588800zbMath0723.90059OpenAlexW2004732730MaRDI QIDQ2276878
Jorge J. Moré, Stephen A. Vavasis
Publication date: 1991
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01588800
Integer programming (90C10) 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, Optimizing the half-product and related quadratic Boolean functions: approximation and scheduling applications, On the solution of multidimensional convex separable continuous knapsack problem with bounded variables, On a nonseparable convex maximization problem with continuous Knapsack constraints, Necessary and sufficient condition for local minima of a class of nonconvex quadratic programs, The symmetric quadratic knapsack problem: approximation and scheduling applications, A class of nonlinear nonseparable continuous Knapsack and multiple-choice knapsack problems, A general purpose exact solution method for mixed integer concave minimization problems, Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution, Effective algorithms for separable nonconvex quadratic programming with one quadratic and box constraints, An efficient global algorithm for indefinite separable quadratic knapsack problems with box constraints, A heuristic algorithm for a chance constrained stochastic program, Allocating procurement to capacitated suppliers with concave quantity discounts, A survey on the continuous nonlinear resource allocation problem, Local minima for indefinite quadratic knapsack problems, Nonconvex piecewise linear knapsack problems, Approximation algorithms for indefinite quadratic programming, Open questions in complexity theory for numerical optimization, Solving knapsack problems with \(S\)-curve return functions, A continuous knapsack problem with separable convex utilities: approximation algorithms and applications, The newsvendor problem with capacitated suppliers and quantity discounts, Scheduling jobs with time-resource tradeoff via nonlinear programming, Inverse optimization for linearly constrained convex separable programming problems, Sufficient optimality criterion for linearly constrained, separable concave minimization problems, On the complexity of finding a local minimizer of a quadratic function over a polytope, Interior-point algorithms for global optimization, The nonlinear knapsack problem - algorithms and applications, Knapsack problems with sigmoid utilities: approximation algorithms via hybrid optimization
Cites Work
- Unnamed Item
- Unnamed Item
- An O(n) algorithm for quadratic knapsack problems
- Constrained global optimization: algorithms and applications
- Checking local optimality in constrained quadratic programming is NP- hard
- Une caractérisation complete des minima locaux en programmation quadratique
- Scheduling of power generation via large-scale nonlinear optimization
- Iterative Methods for Large Convex Quadratic Programs: A Survey
- A lagrangean relaxation algorithm for the constrained matrix problem
- Methods for Global Concave Minimization: A Bibliographic Survey
- Some NP-complete problems in quadratic and nonlinear programming
- Quasi-Newton Updates with Bounds
- Locally unique solutions of quadratic programs, linear and nonlinear complementarity problems
- A polynomially bounded algorithm for a singly constrained quadratic program
- Technical Note—Allocation of Effort Resources among Competing Activities
- On a class of least-element complementarity problems
- Convex Analysis
