Abstract
We consider binary convex quadratic optimization problems, particularly those arising from reformulations of well-known combinatorial optimization problems such as MAX 2SAT (and MAX CUT). A bounding and approximation technique is developed. This technique subsumes the spherical relaxation, while it can also be considered as a restricted variant of the semidefinite relaxation. Its complexity however is comparable to that of the first. It is shown how the quality of the obtained approximate solution can be measured. We conclude with extensive computational results on the MAX 2SAT problem, which show that good-quality solutions are obtained.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
