Abstract
TWO ALGORITHMS of branch-and-bound type for solving non-linear integer mathematical programming problems are considered. The first of them is intended for partially integer problems with a convex target function and linear constraints, and the second is intended for a problem with a polynomial target function, Boolean variables and linear constraints. Experimental results are given for both algorithms.
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 callMore From: USSR Computational Mathematics and Mathematical Physics
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.
