2026-09-19T01:23:28Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/346122022-01-13T07:54:23Zcom_1721.1_7582com_1721.1_7581col_1721.1_131022
George A. Kocur.
Krishnan, Bharath Kumar
Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering.
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
2006-11-07T13:35:10Z
2006-11-07T13:35:10Z
2006
2006
http://hdl.handle.net/1721.1/34612
71304138
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.
Includes bibliographical references (leaves 83-86).
I 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.
by Bharath Kumar Krishnan.
Ph.D.
86 leaves
2920986 bytes
2924517 bytes
application/pdf
application/pdf
eng
Massachusetts Institute of Technology
M.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.
http://dspace.mit.edu/handle/1721.1/7582
Civil and Environmental Engineering.
A multiscale approximation algorithm for the cardinality constrained knapsack problem
Thesis
application/pdf
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="afd0cafc-2680-4075-bebd-67e551cd8337">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>A multiscale approximation algorithm for the cardinality constrained knapsack problem</Title>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2006</PublicationDate>
<Authors>
<Author>
<DisplayName>Krishnan, Bharath Kumar</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Civil and Environmental Engineering.</Keyword>
<Abstract>I 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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>