Abstract
In this paper, we present some explicit local and global optimality conditions for unconstrained binary quadratic problems. Local optimality conditions are categorized by the neighborhood, including 1-flip, 2-flip, and $k$-flip neighborhoods. After defining an evaluation vector and an evaluation matrix, we propose algorithms that make it possible for us to obtain 1-flip and/or 2-flip local solutions in polynomial time. We provide a key insight into the relationship between the local optimality conditions and the global optimality conditions. A discussion of global geometric optimality conditions is also presented in this paper.
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.
