Using a Mixed Integer Programming Tool for Solving the 0–1 Quadratic Knapsack Problem
Published Online:1 May 2004https://doi.org/10.1287/ijoc.1030.0029
References
- Introduction to Optimization (1988) (Wiley)Google Scholar
- Linear programming for the 0–1 quadratic knapsack problem. Eur. J. Oper. Res. (1996) 92:310–325Crossref, Google Scholar
- Best reduction of the quadratic semi-assignment problem. Discrete Appl. Math. (2001) 109:197–213Crossref, Google Scholar
- Billionnet A., Faye A., Soutif E. An exact algorithm for the 0–1 quadratic knapsack problem. ISMP97, Lausanne, Switzerland, August 1997. (1997) Google Scholar
- A new upper bound for the 0–1 quadratic knapsack problem. Eur. J. Oper. Res. (1999) 112:664–672Crossref, Google Scholar
- Exact solution of the quadratic knapsack problem. INFORMS J. Comput. (1999) 11:125–137Link, Google Scholar
- Best network flow bound for the quadratic knapsack problem. Lecture Notes in Mathematics (1986) 226–235No.1403Google Scholar
- Ilog, Inc., CPLEX Division (1998) . CPLEX callable library, Version 6.0. Incline Village, NV, USAGoogle Scholar
- Quadratic knapsack problems. Math. Programming Stud. (1980) 12:132–149Crossref, Google Scholar
- Improved linear integer programming formulations of nonlinear integer problems. Management Sci. (1975) 22:455–460Link, Google Scholar
- Efficient methods for solving quadratic 0–1 knapsack problems. INFOR (1997) 35:170–182Google Scholar
- , Cunningham W. H., McCormick S. T., Queyranne M. Quadratic knapsack relaxation using cutting planes and semidefinite programming. Proc. Fifth IPCO Conf., Lecture Notes Comput. Sci. (1996) (Springer Verlag)175–189No.1084Crossref, Google Scholar
- Lagrangean methods for the 0–1 quadratic knapsack problem. Eur. J. Oper. Res. (1996) 92:326–341Crossref, Google Scholar
- Foundations of Integer Programming (1989) (North-Holland, Amsterdam, The Netherlands)Google Scholar

