Abstract
In the paper [2] a calculus for solving integer optimization problems which can arithmetico proposition logical was developed. In the present paper these studies are used to obtain procedures for solving integer linear optimization problems based on switching algebra algorithms. These procedures differ both from cutting methods and also the known combinational methods. Three procedures, which may allow further modifications, are considered.
Published Version
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.
