Show simple item record

dc.contributor.advisor Young, Richard D.
dc.creatorDimitriou, John I.
dc.date.accessioned 2018-12-18T21:29:28Z
dc.date.available 2018-12-18T21:29:28Z
dc.date.issued 1978
dc.identifier.urihttps://hdl.handle.net/1911/104726
dc.description.abstract In 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.
dc.format.extent 48 pp
dc.language.iso eng
dc.title An implicit enumeration algorithm employing surrogate constraints for solving linear programs with zero-one variables
dc.identifier.digital RICE2362
dc.type.genre Thesis
dc.type.material Text
thesis.degree.department Mathematical Sciences
thesis.degree.discipline Engineering
thesis.degree.grantor Rice University
thesis.degree.level Masters
thesis.degree.name Master of Arts
dc.format.digitalOrigin reformatted digital
dc.identifier.callno Thesis Math. Sci. 1978 Dimitriou
dc.identifier.citation Dimitriou, John I.. "An implicit enumeration algorithm employing surrogate constraints for solving linear programs with zero-one variables." (1978) Master’s Thesis, Rice University. https://hdl.handle.net/1911/104726.


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record