The quadratic knapsack problem—a survey
Top Cited Papers
- 1 March 2007
- journal article
- Published by Elsevier in Discrete Applied Mathematics
- Vol. 155 (5) , 623-648
Abstract
No abstract availableKeywords
This publication has 41 references indexed in Scilit:
- The Quadratic Assignment Problem-Theory and Algorithms.Journal of the Operational Research Society, 1999
- A new upper bound for the 0-1 quadratic knapsack problemEuropean Journal of Operational Research, 1999
- An extended formulation approach to the edge-weighted maximal clique problemEuropean Journal of Operational Research, 1996
- Linear programming for the 0–1 quadratic knapsack problemEuropean Journal of Operational Research, 1996
- Lagrangean methods for the 0–1 Quadratic Knapsack ProblemEuropean Journal of Operational Research, 1996
- A cutting-plane approach to the edge-weighted maximal clique problemEuropean Journal of Operational Research, 1993
- Best network flow bounds for the quadratic knapsack problem1989
- An O(n) algorithm for quadratic knapsack problemsOperations Research Letters, 1984
- Minimum cuts and related problemsNetworks, 1975
- A Capital Budgeting Heuristic Algorithm Using Exchange OperationsA I I E Transactions, 1974