Abstract

Abstract A partitioning procedure is proposed for obtaining approximate solutions to pseudo-Boolean optimization problems (e.g., zero-one polynomial programs). Such a procedure is useful not only in its ability to provide a bound value but further as a means for initializing optimum seeking methods, such as implicit enumeration techniques, employed to insure optimality.

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 call

Disclaimer: 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.