论文信息 - A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1

A tight bound for the boolean quadratic optimization problem and its use in a branch and bound algorithm 1

Known duality statements are used to find tight bounds for the branch and bound process in solving Boolean quadratic optimization problems. To solve the corresponding continuous partial problem, a NEWTON-like procedure is indicated. Superlinear convergence, however, is only obtained in partial cases.

F. Körner

[1] J. Stoer,et al. Convexity and Optimization in Finite Dimensions I , 1970 .

[2] Werner Oettli. Einzelschrittverfahren zur Lösung konvexer und dual‐konvexer Minimierungsprobleme , 1974 .

[3] H. Schwetlick. Numerische Lösung nichtlinearer Gleichungen , 1978 .

[4] P. Hansen. Methods of Nonlinear 0-1 Programming , 1979 .

[5] R. McBride,et al. An Implicit Enumeration Algorithm for Quadratic Integer Programming , 1980 .

[6] Rafael Lazimy,et al. Mixed-integer quadratic programming , 1982, Math. Program..

[7] Claus Richter,et al. Zur effektiven Lösung von booleschen, quadratischen Optimierungsproblemen , 1982 .

[8] F. Barahona,et al. Morphology of ground states of two-dimensional frustration model , 1982 .

[9] Michael W. Carter,et al. The indefinite zero-one quadratic problem , 1984, Discret. Appl. Math..

[10] Frank Körner,et al. Integer quadratic optimization , 1985 .