A multiscale approximation algorithm for the cardinality constrained knapsack problem
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 ste...
Main Author: | Krishnan, Bharath Kumar |
---|---|
Other Authors: | George A. Kocur. |
Format: | Others |
Language: | English |
Published: |
Massachusetts Institute of Technology
2006
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/34612 |
Similar Items
-
Approximation algorithms for minimum knapsack problem
by: Islam, Mohammad Tauhidul, et al.
Published: (2011) -
An approximate shortest path algorithm for hierarchical networks
by: Bhagavatula, Krishna K. (Krishna Kishore)
Published: (2005) -
Online and approximation algorithms for bin-packing and knapsack problems
by: Han, Xin
Published: (2011) -
A Study on Approximation Algorithm for Multi-dimensional Knapsack Problem
by: CHANG, JUI-SHENG, et al.
Published: (2018) -
A multiscale computational framework for cement paste
by: Palkovic, Steven D. (Steven David)
Published: (2018)