Improving an exact approach for solving separable integer quadratic knapsack problems
From MaRDI portal
(Redirected from Publication:434199)
Recommendations
- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
- Integer quadratic knapsack problems
- Upper bounds for large scale integer quadratic multidimensional knapsack problems
Cites work
- A branch and search algorithm for a class of nonlinear knapsack problems
- A genetic algorithm for the multidimensional knapsack problem
- A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
- An Integer Programming Algorithm for Portfolio Selection
- Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Improved Linear Integer Programming Formulations of Nonlinear Integer Problems
- Integer quadratic optimization
- On the numerical realization of the exact penalty method for quadratic programming algorithms
- The nonlinear knapsack problem - algorithms and applications
Cited in
(4)- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- Combining Constraint Propagation and Discrete Ellipsoid-Based Search to Solve the Exact Quadratic Knapsack Problem
- Integer quadratic knapsack problems
- A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
This page was built for publication: Improving an exact approach for solving separable integer quadratic knapsack problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q434199)
