Improving an exact approach for solving separable integer quadratic knapsack problems
From MaRDI portal
Publication:434199
DOI10.1007/s10878-010-9337-3zbMath1245.90098OpenAlexW2073217482MaRDI QIDQ434199
Dominique Quadri, Frederico Della Croce
Publication date: 10 July 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-010-9337-3
Cites Work
- A branch and search algorithm for a class of nonlinear knapsack problems
- On the numerical realization of the exact penalty method for quadratic programming algorithms
- Integer quadratic optimization
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- A genetic algorithm for the multidimensional knapsack problem
- The nonlinear knapsack problem - algorithms and applications
- An Integer Programming Algorithm for Portfolio Selection
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
This page was built for publication: Improving an exact approach for solving separable integer quadratic knapsack problems
