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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
