We consider a wide class of quadratic optimization problems with Boolean vari-

ables. Such problems can be found in economics, planning, project management,

artificial intelligence and computer-aided design. The problems are known to be

NP-hard. In this paper, the lower and upper bounds on the stability radius of the

set of extremum solutions are obtained in the situation where solution space and

criterion space are endowed with various H¨older’s norms.