Summary: The quadratic knapsack problem (QKP) is a well-known combinatorial optimization problem with numerous applications. Given its NP-hard nature, finding optimal solutions or even high quality suboptimal solutions to QKP in the general case is a highly challenging task. In this paper, we propose an iterated “hyperplane exploration” approach (IHEA) to solve QKP approximately. Instead of considering the whole solution space, the proposed approach adopts the idea of searching over a set of hyperplanes defined by a cardinality constraint to delimit the search to promising areas of the solution space. To explore these hyperplanes efficiently, IHEA employs a variable fixing strategy to reduce each hyperplane-constrained sub-problem and then applies a dedicated tabu search procedure to locate high quality solutions within the reduced solution space. Extensive experimental studies over three sets of 220 QKP instances indicate that IHEA competes very favorably with the state-of-the-art algorithms both in terms of solution quality and computing efficiency. We provide additional information to gain insight into the key components of the proposed approach.