A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
From MaRDI portal
Publication:2883573
DOI10.1016/j.endm.2010.05.035zbMath1237.90170MaRDI QIDQ2883573
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.035
Cites Work
- Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
- A genetic algorithm for the multidimensional knapsack problem
- An enumerative algorithm framework for a class of nonlinear integer programming problems
- Solution of Large Quadratic Knapsack Problems Through Aggressive Reduction
- A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems