Young, Richard D.2018-12-182018-12-181978Dimitriou, John I.. "An implicit enumeration algorithm employing surrogate constraints for solving linear programs with zero-one variables." (1978) Master’s Thesis, Rice University. <a href="https://hdl.handle.net/1911/104726">https://hdl.handle.net/1911/104726</a>.https://hdl.handle.net/1911/104726In this paper, an implicit enumeration algorithm is illustrated. Surrogate constraints were used in a special way, to modify and thus obtain) another version of implicit enumeration for solving zero-one problems. For unity and completeness of the paper a brief background is given on the basic ideas of implicit enumeration, and on how surrogate constraints are normally used. Then the algorithm and its rules follow, as special cases of the general considerations. Finally a computer code illustrates the practicality of the method. Further research can be done, to determine how surrogate constraints affect the efficiency of the algorithm, the number of iterations and the computational time.48 ppengCopyright is held by the author, unless otherwise indicated. Permission to reuse, publish, or reproduce the work beyond the bounds of fair use or other exemptions to copyright law must be obtained from the copyright holder.ThesisRICE2362reformatted digitalThesis Math. Sci. 1978 Dimitriou