A multiscale approximation algorithm for the cardinality constrained knapsack problem

A multiscale approximation algorithm for the cardinality constrained knapsack problem

Thesis (Ph. D.)--Massachusetts Institute of Technology, Dept. of Civil and Environmental Engineering, 2006.

Bibliographic Details
Main Author:	Krishnan, Bharath Kumar
Other Authors:	George A. Kocur.
Format:	Thesis
Language:	eng
Published:	Massachusetts Institute of Technology 2006
Subjects:	Civil and Environmental Engineering.
Online Access:	http://hdl.handle.net/1721.1/34612

Similar Items

An approximate shortest path algorithm for hierarchical networks
by: Bhagavatula, Krishna K. (Krishna Kishore)
Published: (2005)

A multiscale computational framework for cement paste
by: Palkovic, Steven D. (Steven David)
Published: (2018)

Multiscale modeling of clay-water systems
by: Ebrahimi, Davoud
Published: (2014)

Cardinality constrained portfolio optimization using multi-objective evolutionary algorithms
by: Ashok, Vivek Kumar.
Published: (2013)

Multiscale strength homogenization : application to shale nanoindentation
by: Gathier, Benjamin
Published: (2008)

Optimization models and algorithms for large-scale, capacity constrained pick-up and delivery problems with time windows
by: Tardy, Raphaël, 1979-
Published: (2006)

A multiscale framework for the chemomechanical characterization of ancient heterogeneous materials
by: Maragh, Janille Maria.
Published: (2021)

Reduced basis approximation and a posteriori error estimation for non-coercive elliptic problems : applications to acoustics
by: Sen, Sugata, 1977-
Published: (2007)

Multiscale structural investigation of bamboo under compressive Loading
by: Cui, Junhe
Published: (2017)

Multiscale modeling of two-dimensional materials : structures, properties, and designs
by: Jung, Gang Seob.
Published: (2019)

Faster fully polynomial approximation schemes for Knapsack problems
by: Rhee, Donguk
Published: (2015)

Debonding in bi-layer material systems under moisture effect : a multiscale approach
by: Lau, Tak-bun, Denvid
Published: (2012)

Scaling algorithms for multicommodity flow problems and network flow problems with side constraits
by: Schneur, Rina
Published: (2005)

Multiscale modeling and simulation of deformation and failure mechanisms of hierarchical alpha-helical protein materials
by: Bertaud, Jeremie
Published: (2010)

Continuous time algorithms for a variant of the dynamic traffic assignment problem
by: Farver, Jennifer M. (Jennifer Margaret), 1976-
Published: (2014)

A hybrid guided neighborhood search for the disjunctively constrained knapsack problem
by: Mhand Hifi, et al.
Published: (2015-12-01)

Knapsack problems: algorithms and computer implementations/
by: 211429 Martello, Silvano, et al.
Published: (1989)

Knapsack problems : algorithms and computer implementations /
by: 211429 Martello, Silvano, et al.
Published: (1990)

Developing strategies for resource-constrained transit growth through increased private sector involvement
by: Gordon, Michael A. (Michael Andrew)
Published: (2015)

Motion based design : solution algorithms to the inverse problem with applications to seismic design
by: Gallegos, Carlos Mario, 1973-
Published: (2009)

A flow-based approach to the dynamic traffic assignment problem : formulations, algorithms, and computer implementatins
by: He, Yiy
Published: (2005)

Parallel implementations of dynamic traffic assignment models and algorithms for dynamic shortest path problems
by: Jiang, Hai, 1979-
Published: (2006)

Computationally efficient simulation-based optimization algorithms for large-scale urban transportation problems
by: Chong, Linsen
Published: (2017)

The degree constrained k-cardinality minimum spanning tree problem: a lexi-search algorithm
by: Thenepalle Jayanth Kumar, et al.
Published: (2018-10-01)

Partitioning algorithms for a class of knapsack problems
by: Pierce, John F.
Published: (2009)

Time-dependent networks : data representation techniques and shortest path algorithms with applications to transportation problems
by: Yadappanavar, Vinay M. (Vinay Muralidhara), 1976-
Published: (2005)

Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems
Published: (2003)

Implementation of genetic algorithms in solving the knapsack problem /
by: 367992 Teoh, Beng Khoon
Published: (2001)

W-SPSA : an Efficient Stochastic Approximation Algorithm for the off-line calibration of Dynamic Traffic Assignment models
by: Lu, Lu, S.M. Massachusetts Institute of Technology
Published: (2014)

DESIGN AND EXAMINATION OF ALGORITHMS FOR SOLVING THE KNAPSACK PROBLEM
by: S. Kantsedal, et al.
Published: (2015-07-01)

Modeling route choice behavior in the presence of information using concepts from fuzzy set theory and approximate reasoning
by: Lotan, Tsippy
Published: (2005)

Study of knapsack cryptosystems
by: Sathia Seelan Vetrichelvan
Published: (2020)

A hybrid genetic algorithm for constrained multi-objective optimization under uncertainty and target matching problems
by: Wang, N. F., et al.
Published: (2013)

Presentation and comparision of an exact structural analysis code with the MIT design method and the coupled wall approximate deflection analysis procedure
by: King, Gerald D., 1974-
Published: (2009)

Knapsack Problem Solution based on Knapsack Packing Tree Search
by: Mikhail Andreevich Kupriyashin, et al.
Published: (2014-02-01)

A self-adaptive step-size search algorithm for the cardinality constrained portfolio optimisation problem
by: Zi, Xuan Loke, et al.
Published: (2024)

On а Recursive-Parallel Algorithm for Solving the Knapsack Problem
by: Vladimir V. Vasilchikov
Published: (2018-04-01)

Average-Case Performance of Rollout Algorithms for Knapsack Problems
by: Mastin, Andrew, et al.
Published: (2015)

Formulations and algorithms for the recoverable Γ-robust knapsack problem
by: Christina Büsing, et al.
Published: (2019-03-01)

Algorithms for routing problems in stochastic time-dependent networks
by: Kang, Seong-Cheol, 1968-
Published: (2014)