Show simple item record

dc.contributor.advisorGeorge A. Kocur.en_US
dc.contributor.authorKrishnan, Bharath Kumaren_US
dc.contributor.otherMassachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.en_US
dc.date.accessioned2006-11-07T13:35:10Z
dc.date.available2006-11-07T13:35:10Z
dc.date.copyright2006en_US
dc.date.issued2006en_US
dc.identifier.urihttp://hdl.handle.net/1721.1/34612
dc.descriptionThesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.en_US
dc.descriptionIncludes bibliographical references (leaves 83-86).en_US
dc.description.abstractI develop a multiscale approximation algorithm for the cardinality constrained knapsack problem. The algorithm consists of three steps: a rounding and reduction step where a hierarchical representation of the problem data ranging from coarse to fine is generated, a solution step where a coarse solution is computed, and a refinement step where the accuracy of the solution is improved by refining the problem representation. I demonstrate that the algorithm is fully polynomial with a runtime complexity that improves upon the previous best known fully polynomial approximation scheme. Through an extensive computational study, I show that the running times of the algorithm is less than or equal to that of a commercial integer programming package with little loss in solution accuracy.en_US
dc.description.statementofresponsibilityby Bharath Kumar Krishnan.en_US
dc.format.extent86 leavesen_US
dc.format.extent2920986 bytes
dc.format.extent2924517 bytes
dc.format.mimetypeapplication/pdf
dc.format.mimetypeapplication/pdf
dc.language.isoengen_US
dc.publisherMassachusetts Institute of Technologyen_US
dc.rightsM.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission.en_US
dc.rights.urihttp://dspace.mit.edu/handle/1721.1/7582
dc.subjectCivil and Environmental Engineering.en_US
dc.titleA multiscale approximation algorithm for the cardinality constrained knapsack problemen_US
dc.typeThesisen_US
dc.description.degreePh.D.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Civil and Environmental Engineering
dc.identifier.oclc71304138en_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record