A multiscale approximation algorithm for the cardinality constrained knapsack problem
Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Thesis |
| Language: | eng |
| Published: |
Massachusetts Institute of Technology
2006
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/1721.1/34612 |
| _version_ | 1811088982054797312 |
|---|---|
| author | Krishnan, Bharath Kumar |
| author2 | George A. Kocur. |
| author_facet | George A. Kocur. Krishnan, Bharath Kumar |
| author_sort | Krishnan, Bharath Kumar |
| collection | MIT |
| description | Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006. |
| first_indexed | 2024-09-23T14:11:29Z |
| format | Thesis |
| id | mit-1721.1/34612 |
| institution | Massachusetts Institute of Technology |
| language | eng |
| last_indexed | 2024-09-23T14:11:29Z |
| publishDate | 2006 |
| publisher | Massachusetts Institute of Technology |
| record_format | dspace |
| spelling | mit-1721.1/346122019-04-11T00:56:05Z A multiscale approximation algorithm for the cardinality constrained knapsack problem Krishnan, Bharath Kumar George A. Kocur. Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering. Massachusetts Institute of Technology. Dept. of Civil and Environmental Engineering. Civil and Environmental Engineering. 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. 2006-11-07T13:35:10Z 2006-11-07T13:35:10Z 2006 2006 Thesis http://hdl.handle.net/1721.1/34612 71304138 eng 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 86 leaves 2920986 bytes 2924517 bytes application/pdf application/pdf application/pdf Massachusetts Institute of Technology |
| spellingShingle | Civil and Environmental Engineering. Krishnan, Bharath Kumar A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title | A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title_full | A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title_fullStr | A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title_full_unstemmed | A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title_short | A multiscale approximation algorithm for the cardinality constrained knapsack problem |
| title_sort | multiscale approximation algorithm for the cardinality constrained knapsack problem |
| topic | Civil and Environmental Engineering. |
| url | http://hdl.handle.net/1721.1/34612 |
| work_keys_str_mv | AT krishnanbharathkumar amultiscaleapproximationalgorithmforthecardinalityconstrainedknapsackproblem AT krishnanbharathkumar multiscaleapproximationalgorithmforthecardinalityconstrainedknapsackproblem |