Abstract
This paper compares the following implicit enumeration algorithms for solving a linear zero-one programming (LZOP) problem: Balas' additive algorithm, Hammer-Rudeanu's algorithm, Peterson's algorithm, Zionts' generalized additive algorithm, Geoffrion's improved implicit enumeration algorithm and Zionts' generalized additive algorithm with surrogate constraints. The computational efficiency of these algorithms is compared in terms of computer time and the number of iterations required to solve unstructured problems. Some guidelines for selecting an appropriate algorithm for a given problem size are given.
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.
