Abstract
In this paper we describe computational experience in solving unconstrained quadratic zero-one problems using a branch and bound algorithm. The algorithm incorporates dynamic preprocessing techniques for forcing variables and heuristics to obtain good starting points. Computational results and comparisons with previous studies on several hundred test problems with dimensions up to 200 demonstrate the efficiency of our algorithm.
Zusammenfassung
In dieser Arbeit beschreiben wir rechnerische Erfahrungen bei der Lösung von unbeschränkten quadratischen Null-Eins-Problemen mit einem “Branch and Bound”-Algorithmus. Der Algorithmus erlaubt dynamische Vorbereitungs-Techniken zur Erzwingung ausgewählter Variablen und Heuristiken zur Wahl von guten Startpunkten. Resultate von Berechnungen und Vergleiche mit früheren Arbeiten mit mehreren hundert Testproblemen mit Dimensionen bis 200 zeigen die Effizienz unseres Algorithmus.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles, news and stories from top researchers in related subjects.References
Barahona, F., A Solvable Case of Quadratic 0–1 Programming, Discrete Applied Mathematics13 (1986), 23–26.
Barahona, F., Jünger, M., Reinelt, G., Experiments in Quadratic 0–1 Programming, Mathematical Programming44 (1989), 127–137.
Carter, M. W., The Indefinite Zero-One Quadratic Problem, Discrete Applied Mathematics7 (1984), 23–44.
Cooper, M., A Survey of Methods for Pure Nonlinear Integer Programming, Management Science3 (1981), 356–361.
Gallo, G., Hammer, P. L., Simeone, B., Quadratic Knapsack Problems, Mathematical Programming12 (1980), 132–149.
Gulati, V. P., Gupta, S. K., Mittal, A. K., Unconstrained Quadratic Bivalent Programming Problem, European Journal of Operational Research,15 (1984), 121–125.
Hansen, P., Hammer, P. L., Logical relations in quadratic 0–1 programming, Revue Roumaine de Mathematiques Pures et Appliques,20 (1984), 418–427.
Hammer, P. L., Hansen, P., Simeone, B., Roof Duality, Complementation, and Persistency in Quadratic 0–1 Optimization, Mathematical Programming,28(2), (1984), 121–155.
Hansen, P., Methods of Nonlinear 0–1 Programming, Annals of Discrete Mathematics5 (1979), 53–70.
Shi Hui, L., An Improved Enumerative Algorithm for Solving Quadratic Zero-One Programming, European Journal of Operational Research15 (1984), 110–120.
Jha, S., Pardalos, P. M., Graph Separation Techniques for Quadratic Zero-One Programming, Technical Report CS-87-39, Computer Science Department, The Pennsylvania State University (1987).
Körner, F., An Efficient Branch and Bound Algorithm to Solve the Quadratic Integer Programming Problem, Computing30 (1983), 253–260.
Krarup, J., Pruza, P. A., Computer Aided Layout Design, Mathematical Programming Study9 (1978), 75–94.
Lewis, P., Goodman, A. S., Miller, J. M., Pseudo-Random Number Generator for the System/360, IBM Systems Journal,8(2), (1969), 300–312.
McBride, R. D., Yormark, J. S., An Implicit Enumeration Algorithm for Quadratic Integer Programming, Management Science26(3) (1980), 282–296.
Pardalos, P. M., Construction of test problems in quadratic bivalent programming, To appear in ACM TOMS (1990).
Pardalos, P. M., Rodgers, G. P., Parallel branch and bound algorithms for unconstrained quadratic zero-one programming. In: Impacts of Recent Computer Advances on Operations Research, (eds R. Sharda et al. 1989), North-Holland, 131–143.
Pardalos, P. M., Rodgers, G. P., A branch and bound algorithm for the maximum clique problem, To appear in Mathematical Programming.
Pardalos, P. M., Rosen, J. B., Global Constrained Optimization: Algorithms and Applications, Lecture Notes in Computer Sciences268 Berlin-Heidelberg-New York: Springer (1987).
Picard, J. C., Ratliff, H. D., Minimum Cuts and Related Problems, Networks5 (1974), 357–370.
Rodgers, G. P. Algorithms for Unconstrained Quadratic 0–1 Programming and Related Problems on Contemporary Computer Architectures, Ph.D. Dissertation, The Pennsylvania State University, (1989).
Williams, A. C., Quadratic 0–1 Programming Using the Roof Dual with Computational Results, RUTCOR Research Report #8-85, The State University of New Jersey, (1985).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Pardalos, P.M., Rodgers, G.P. Computational aspects of a branch and bound algorithm for quadratic zero-one programming. Computing 45, 131–144 (1990). https://doi.org/10.1007/BF02247879
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF02247879