On the complexity of local search in unconstrained quadratic binary optimization

Details On the complexity of local search in unconstrained quadratic binary optimization On the complexity of local search in unconstrained quadratic binary optimization

2007-01-06

arxiv.org/abs/math/0701184v1

Mathematics

Optimization and Control

6 pages

Scientific paper

We show by construction that the procedure of local search for the problem of
finding a local optimum of a quadratic pseudo-boolean function takes
exponential time in the worst case, regardless of the neighbor selection and
tie-breaking rules.

Affiliated with

Also associated with

No associations

Rating

On the complexity of local search in unconstrained quadratic binary optimization does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with On the complexity of local search in unconstrained quadratic binary optimization, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and On the complexity of local search in unconstrained quadratic binary optimization will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-305595