A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
From MaRDI portal
Publication:1108931
DOI10.1016/0167-6377(88)90041-7zbMath0654.90058OpenAlexW2086980698MaRDI QIDQ1108931
Harvey M. Salkin, Mohamed Djerdjour, Kamlesh Mathur
Publication date: 1988
Published in: Operations Research Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0167-6377(88)90041-7
Related Items
On Generalized Surrogate Duality in Mixed-Integer Nonlinear Programming ⋮ Exact solution method to solve large scale integer quadratic multidimensional knapsack problems ⋮ A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem ⋮ Quadratic resource allocation with generalized upper bounds ⋮ Separable relaxation for nonconvex quadratic integer programming: Integer diagonalization approach ⋮ Indefinite multi-constrained separable quadratic optimization: large-scale efficient solution ⋮ Improving an exact approach for solving separable integer quadratic knapsack problems ⋮ A survey on the continuous nonlinear resource allocation problem ⋮ Completely positive and copositive program modelling for quadratic optimization problems ⋮ Convergent Lagrangian and domain cut method for nonlinear knapsack problems ⋮ Surrogate dual method for multi-dimensional nonlinear knapsack problems ⋮ Reformulation of the Quadratic Multidimensional Knapsack Problem as Copositive/Completely Positive Prorams ⋮ A conjugate direction based simplicial decomposition framework for solving a specific class of dense convex quadratic programs ⋮ An enumerative algorithm framework for a class of nonlinear integer programming problems ⋮ A nonlinear multidimensional knapsack problem in the optimal design of mixture experiments ⋮ An approximate dynamic programming approach to convex quadratic knapsack problems ⋮ A dual ascent method for the portfolio selection problem with multiple constraints and linked proposals ⋮ Exact algorithm for concave knapsack problems: linear underestimation and partition method ⋮ On generalized surrogate duality in mixed-integer nonlinear programming
Cites Work
- Unnamed Item
- A branch and search algorithm for a class of nonlinear knapsack problems
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- Computer experiments on quadratic programming algorithms
- New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
- Surrogate Constraints
- A Branch Search Algorithm for the Knapsack Problem
