A multiscale approximation algorithm for the cardinality constrained knapsack problem
Name
71304138-MIT.pdf
Description
Full printable version
Size
4.78 MB
Format
Adobe PDF
Checksum (MD5)
5eac5ce44f74f9deb628a0ae8b288c86
Author(s)
Krishnan, Bharath Kumar
Advisor(s)
George A. Kocur.
Date Issued
2006
Publisher
Massachusetts Institute of Technology
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.
Description
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.
Includes bibliographical references (leaves 83-86).
Subjects
Civil and Environmental Engineering.
MIT Department
Massachusetts Institute of Technology. Department of Civil and Environmental Engineering
Terms of Use
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.
Persistent DSpace Link
