Efficient methods for solving quadratic 0-1 knapsack problems

INFOR

Volumn 35, Issue 3, 1997, Pages 170-182

  Hammer, Peter L ^a,b,c,d   Rader Jr , David J ^a,d,e  

^a RUTGERS UNIVERSITY   (United States)

^b UNIVERSITY OF BUCHAREST   (Romania)

^c SWISS FEDERAL INSTITUTE OF TECHNOLOGY   (Switzerland)

^d the State University of New Jersey   (United States)

^e UNIVERSITY OF RICHMOND   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001036916     PISSN: 03155986     EISSN: None     Source Type: Journal    
DOI: 10.1080/03155986.1997.11732327     Document Type: Article

References (15)

1. Chaillou, P., Hansen, P. and Mahieu, Y., "Best Network Flow Bounds for the Quadratic Knapsack Problem," Lecture Notes in Mathematics 1403(1986), 226-235.
2. Crama, Y. and Mazzola, J.B., "Valid Inequalities and Facets for a Hypergraph Model of the Non-linear Knapsack and the FMS Part Selection Problems," Annals of Operations Research 58(1995), 99-128.
3. Dembo, R.S. and Hammer, P.L., "A Reduction Algorithm for Knapsack Problems," Methods of Operations Research, 36(1980), 49-60.
4. Gallo, G., Grigoriadis, M. and Tarjan, R., "A Fast Parametric Maximum Flow Algorithm and Applications," SIAM Journal on Computing, 18(1989), 30-55.
5. Gallo, G., Hammer, P.L., and Simeone, B., "Quadratic Knapsack Problems," Mathematical Programming 12(1980), 132-149.
6. Gallo, G. and Simeone, S., "On the Supermodular Knapsack Problem," Mathematical Programming, 45(1988), 295-309.
7. Geoffrion, A.M., "Lagrangean Relaxation for Integer Programming," Mathematical Programming Study, 2(1974), 82-114.
8. Hammer, P.L. and Hansen, P., "Logical Relations in Quadratic 0-1 Programming," Revue Roumaine de Math. Pures et Appl. 26(1981), 421-429.
9. Hammer, P.L. and Holzman, R., "Approximations of Pseudo-Boolean Functions; Applications to Game Theory," ZOR - Methods and Models of Operations Research, 36(1992), 3-21.
10. Hammer, P.L, Padberg, M., Peled, U., "Constraint Pairing in Integer Programming," INFOR 13(1975), 68-81.
11. Hammer, P.L. and Simeone, B., "Order Relations of Variables in 0 - 1 Programming", Annals of Discrete Mathematics (North-Holland, 1987)
12. Johnson, E.L., Mehrotra, A. and Nemhauser, G.L, "Min-Cut Clustering," Mathematical Programming, 62(1993), 133-151.
13. Körner, F., "A New Bound for the Quadratic Knapsack Problem and its Use in a Branch and Bound Algorithm," Optimization, 17(1986), 643-648.
14. Lengauer, T., Combinatorial Algorithms for Integrated Circuit Layout (Wiley, Chichester, 1990).
15. Peterson. C.C., "A Capital Budgeting Heuristic Algorithm using Exchange Operations," AIIE Transactions 6(1974), 143-150.