Linear programming for the 0-1 quadratic knapsack problem

European Journal of Operational Research

Volumn 92, Issue 2, 1996, Pages 310-325

  Billionnet, Alain ^a   Calmels, Frédéric ^a  

^a CEDRIC   (France)

Author keywords

Branch and bound; Computational analysis; Knapsack problem; Linearization; Zero one quadratic programming

Indexed keywords

ALGORITHMS; BOOLEAN FUNCTIONS; CALCULATIONS; COMPUTATIONAL METHODS; CONSTRAINT THEORY; HEURISTIC METHODS; LINEAR PROGRAMMING; LINEARIZATION; PROBLEM SOLVING;

BRANCH AND BOUND; COMPUTATIONAL ANALYSIS; LINEAR CAPACITY CONSTRAINTS; PSEUDO BOOLEAN QUADRATIC FUNCTION; QUADRATIC KNAPSACK PROBLEM; ZERO ONE QUADRATIC PROGRAMMING;

OPERATIONS RESEARCH;

EID: 0030189996     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/0377-2217(94)00229-0     Document Type: Article

References (20)

1. Adams, W.P., and Sherali, H.D. (1986), "A tight linearization and an algorithm for zero-one quadratic programming problems", Management Science 32/10, 1274-1290.
2. Barahona, F., Jünger, M., and Reinelt, G. (1989), "Experiments in quadratic 0-1 programming", Mathematical Programming 44, 127-137.
3. Billionnet, A., and Sutter, A. (1994), "Minimization of a quadratic pseudo-Boolean function", European Journal of Operational Research 78, 106-115.
4. Billionnet, A., and Costa, M.-C., and Sutter, A. (1989), "Les problèmes de placement dans les systèmes distribués", Technique et Sciences Informatiques 8/4, 307-337.
5. Carter, M.W. (1984), "The indefinite zero-one quadratic problem", Discrete Applied Mathematics 7, 23-44.
6. Chaillou, P., Hansen, P., and Mahieu, Y. (1983), "Best network flow bound for the Quadratic Knapsack Problem", presented at NETFLOW 83 International Workshop, Pisa, Italy.
7. Chardaire, P., and Sutter, A. (1995), "A decomposition method for quadratic 0-1 programming", Management Science 41/4, 704-712.
8. Gallo, G., and Simeone, B. (1988), "On the Supermodular Knapsack Problem", Mathematical Programming 45, 295-309.
9. Gallo, G., Grigoriadis, M.D., and Tarjan, R.E., (1989), "A fast parametric maximum flow algorithm and application", SIAM Journal on Computing 18/1, 30-35.
10. Gallo, G., Hammer, P.L., Simeone, B. (1980), "Quadratic Knapsack Problems", Mathematical Programming 12, 132-149.
11. Hammer, P.L., Hansen, P., and Simeone, B. (1984), "Roof duality, complementation and persistency in quadratic 0-1 optimization", Mathematical Programming 28, 121-155.
12. Hansen, P. (1979), "Methods of non-linear 0-1 programming", Annals of Discrete Mathematics 5, 53-70.
13. Körner, F. (1986), "A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm", Optimization 17, 643-648.
14. Laughhunn, D.J. (1970), "Quadratic binary programming with applications to capital budgeting problems", Operations Research 18, 454-461.
15. Michelon, P., and Maculan, N. (1993), "Lagrangean methods for 0-1 quadratic programming", Discrete Applied Mathematics 42/2-3, 257-269.
16. Michelon, P., and Veuilleux, L. (1991), Lagrangean methods for the 0-1 Quadratic Knapsack Problem", Publication #779, D.I.R.O., Université de Montréal.
17. Pardalos, P.M., and Rodgers, G. (1990), "Computational aspects of a branch and bound algorithm for quadratic zero-one programming", Computing 45, 131-144.
18. Rao, G.S., Stone, H.S., and Hu, T.C. (1979), "Assignment of tasks in a distributed processor system with limited memory", IEEE Transactions on Computers 28/4, 291-299.
19. Williams, A.C. (1985), "Quadratic zero-one programming using the roof dual with computational results", Rutcor Research Report, 8-85, Rutgers University.
20. Witzgall, C. (1975), "Mathematical methods of site selection for Electronic Message System (EMS)", NBS Internal Report.