Advanced search options

Advanced Search Options 🞨

Browse by author name (“Author name starts with…”).

Find ETDs with:

in
/  
in
/  
in
/  
in

Written in Published in Earliest date Latest date

Sorted by

Results per page:

Sorted by: relevance · author · university · dateNew search

University: University of Waterloo

You searched for subject:(algorithm approximation complexity convex nonconvex optimazation programming randomized stochastic). Showing records 1 – 30 of 392 total matches.

[1] [2] [3] [4] [5] … [14]

Search Limiters

Last 2 Years | English Only

▼ Search Limiters


University of Waterloo

1. Linhares Rodrigues, Andre. Approximation Algorithms for Distributionally Robust Stochastic Optimization.

Degree: 2019, University of Waterloo

 Two-stage stochastic optimization is a widely used framework for modeling uncertainty, where we have a probability distribution over possible realizations of the data, called scenarios,… (more)

Subjects/Keywords: approximation algorithms; stochastic optimization; discrete optimization; convex optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Linhares Rodrigues, A. (2019). Approximation Algorithms for Distributionally Robust Stochastic Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14639

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Linhares Rodrigues, Andre. “Approximation Algorithms for Distributionally Robust Stochastic Optimization.” 2019. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/14639.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Linhares Rodrigues, Andre. “Approximation Algorithms for Distributionally Robust Stochastic Optimization.” 2019. Web. 08 Dec 2019.

Vancouver:

Linhares Rodrigues A. Approximation Algorithms for Distributionally Robust Stochastic Optimization. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/14639.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Linhares Rodrigues A. Approximation Algorithms for Distributionally Robust Stochastic Optimization. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14639

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

2. Jain, Kshitij. Minimum Shared-Power Edge Cut.

Degree: 2018, University of Waterloo

 We introduce a problem called the Minimum Shared-Power Edge Cut (MSPEC). The input to the problem is an undirected edge-weighted graph with distinguished vertices s… (more)

Subjects/Keywords: Algorithms; Computational Geometry; Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jain, K. (2018). Minimum Shared-Power Edge Cut. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13664

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/13664.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jain, Kshitij. “Minimum Shared-Power Edge Cut.” 2018. Web. 08 Dec 2019.

Vancouver:

Jain K. Minimum Shared-Power Edge Cut. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/13664.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jain K. Minimum Shared-Power Edge Cut. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13664

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

3. Truszkowski, Jakub. Fast Algorithms for Large-Scale Phylogenetic Reconstruction.

Degree: 2013, University of Waterloo

 One of the most fundamental computational problems in biology is that of inferring evolutionary histories of groups of species from sequence data. Such evolutionary histories,… (more)

Subjects/Keywords: phylogeny; randomized algorithm; quartet; Markov chain

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Truszkowski, J. (2013). Fast Algorithms for Large-Scale Phylogenetic Reconstruction. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8011

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/8011.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Truszkowski, Jakub. “Fast Algorithms for Large-Scale Phylogenetic Reconstruction.” 2013. Web. 08 Dec 2019.

Vancouver:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Internet] [Thesis]. University of Waterloo; 2013. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/8011.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Truszkowski J. Fast Algorithms for Large-Scale Phylogenetic Reconstruction. [Thesis]. University of Waterloo; 2013. Available from: http://hdl.handle.net/10012/8011

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

4. Musleh, Yossef. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.

Degree: 2018, University of Waterloo

 This thesis introduces a new Monte Carlo randomized algorithm for computing the characteristic polynomial of a rank-2 Drinfeld module. We also introduce a deterministic algorithm(more)

Subjects/Keywords: Drinfeld; Module; Elliptic; Curve; Cryptography; Algorithm; Randomized

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Musleh, Y. (2018). Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/13889

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/13889.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Musleh, Yossef. “Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module.” 2018. Web. 08 Dec 2019.

Vancouver:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Internet] [Thesis]. University of Waterloo; 2018. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/13889.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Musleh Y. Fast Algorithms for Finding the Characteristic Polynomial of a Rank-2 Drinfeld Module. [Thesis]. University of Waterloo; 2018. Available from: http://hdl.handle.net/10012/13889

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

5. Shateri, Mahsa. Task Optimization and Workforce Scheduling.

Degree: 2011, University of Waterloo

 This thesis focuses on task sequencing and manpower scheduling to develop robust schedules for an aircraft manufacturer. The production of an aircraft goes through a… (more)

Subjects/Keywords: Scheduling; Two-stage stochastic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Shateri, M. (2011). Task Optimization and Workforce Scheduling. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6241

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Shateri, Mahsa. “Task Optimization and Workforce Scheduling.” 2011. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/6241.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Shateri, Mahsa. “Task Optimization and Workforce Scheduling.” 2011. Web. 08 Dec 2019.

Vancouver:

Shateri M. Task Optimization and Workforce Scheduling. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/6241.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Shateri M. Task Optimization and Workforce Scheduling. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6241

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

6. Koh, Zhuan Khye. Stabilizing Weighted Graphs.

Degree: 2017, University of Waterloo

 An edge-weighted graph G = (V,E) is called stable if the value of a maximum-weight matching equals the value of a maximum-weight fractional matching. Stable… (more)

Subjects/Keywords: Matching; Game Theory; Network Bargaining; Approximation Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Koh, Z. K. (2017). Stabilizing Weighted Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12246

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/12246.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Koh, Zhuan Khye. “Stabilizing Weighted Graphs.” 2017. Web. 08 Dec 2019.

Vancouver:

Koh ZK. Stabilizing Weighted Graphs. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/12246.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Koh ZK. Stabilizing Weighted Graphs. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12246

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

7. Tilak, Hrushikesh. Computing sparse multiples of polynomials.

Degree: 2010, University of Waterloo

 We consider the problem of finding a sparse multiple of a polynomial. Given a polynomial f ∈ F[x] of degree d over a field F,… (more)

Subjects/Keywords: complexity; polynomial; sparse; multiple; algorithm; lowerbound

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Tilak, H. (2010). Computing sparse multiples of polynomials. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5455

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/5455.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Tilak, Hrushikesh. “Computing sparse multiples of polynomials.” 2010. Web. 08 Dec 2019.

Vancouver:

Tilak H. Computing sparse multiples of polynomials. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/5455.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Tilak H. Computing sparse multiples of polynomials. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5455

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

8. Ahmadian, Sara. Approximation Algorithms for Clustering and Facility Location Problems.

Degree: 2017, University of Waterloo

 Facility location problems arise in a wide range of applications such as plant or warehouse location problems, cache placement problems, and network design problems, and… (more)

Subjects/Keywords: Approximation algorithms; Facility location problems; Clustering; Mobile facility location problem; Min-load k-facility location; Lower-bounded clustering with outliers; Lower-bounded clustering; Clustering with outliers; Local search algorithm; Primal-dual algorithm; Linear-programming rounding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmadian, S. (2017). Approximation Algorithms for Clustering and Facility Location Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/11640

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/11640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmadian, Sara. “Approximation Algorithms for Clustering and Facility Location Problems.” 2017. Web. 08 Dec 2019.

Vancouver:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/11640.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmadian S. Approximation Algorithms for Clustering and Facility Location Problems. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/11640

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

9. Au, Yu Hin. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.

Degree: 2014, University of Waterloo

 In both mathematical research and real-life, we often encounter problems that can be framed as finding the best solution among a collection of discrete choices.… (more)

Subjects/Keywords: combinatorial optimization; lift-and-project methods; integer programming; semidefinite programming; convex relaxations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Au, Y. H. (2014). A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Au, Yu Hin. “A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.” 2014. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/8662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Au, Yu Hin. “A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization.” 2014. Web. 08 Dec 2019.

Vancouver:

Au YH. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/8662.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Au YH. A Comprehensive Analysis of Lift-and-Project Methods for Combinatorial Optimization. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8662

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

10. Dippel, Jack. The Matching Augmentation Problem: A 7/4-Approximation Algorithm.

Degree: 2019, University of Waterloo

 We present a 7/4 approximation algorithm for the matching augmentation problem (MAP): given a multi-graph with edges of cost either zero or one such that… (more)

Subjects/Keywords: map; matching augmentation problem; approximation algorithm; 7/4

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Dippel, J. (2019). The Matching Augmentation Problem: A 7/4-Approximation Algorithm. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14700

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Dippel, Jack. “The Matching Augmentation Problem: A 7/4-Approximation Algorithm.” 2019. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/14700.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Dippel, Jack. “The Matching Augmentation Problem: A 7/4-Approximation Algorithm.” 2019. Web. 08 Dec 2019.

Vancouver:

Dippel J. The Matching Augmentation Problem: A 7/4-Approximation Algorithm. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/14700.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Dippel J. The Matching Augmentation Problem: A 7/4-Approximation Algorithm. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14700

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

11. Jankovits, Ibolya. An Improved Convex Optimization Model for Two-Dimensional Facility Layout.

Degree: 2007, University of Waterloo

 The facility layout design problem is a fundamental optimization problem encountered in many manufacturing and service organizations that was originally formulated in 1963 by Armour… (more)

Subjects/Keywords: Facility Layout; Convex Optimization; Mathematical Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Jankovits, I. (2007). An Improved Convex Optimization Model for Two-Dimensional Facility Layout. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2694

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Jankovits, Ibolya. “An Improved Convex Optimization Model for Two-Dimensional Facility Layout.” 2007. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/2694.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Jankovits, Ibolya. “An Improved Convex Optimization Model for Two-Dimensional Facility Layout.” 2007. Web. 08 Dec 2019.

Vancouver:

Jankovits I. An Improved Convex Optimization Model for Two-Dimensional Facility Layout. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/2694.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Jankovits I. An Improved Convex Optimization Model for Two-Dimensional Facility Layout. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2694

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

12. Gupta, Shubham. Building Networks in the Face of Uncertainty.

Degree: 2011, University of Waterloo

 The subject of this thesis is to study approximation algorithms for some network design problems in face of uncertainty. We consider two widely studied models… (more)

Subjects/Keywords: robust optimization; stochastic optimization; network design; facility location; steiner tree; steiner forest; approximation algorithms

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gupta, S. (2011). Building Networks in the Face of Uncertainty. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6140

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gupta, Shubham. “Building Networks in the Face of Uncertainty.” 2011. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/6140.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gupta, Shubham. “Building Networks in the Face of Uncertainty.” 2011. Web. 08 Dec 2019.

Vancouver:

Gupta S. Building Networks in the Face of Uncertainty. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/6140.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gupta S. Building Networks in the Face of Uncertainty. [Thesis]. University of Waterloo; 2011. Available from: http://hdl.handle.net/10012/6140

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

13. Laekhanukit, Bundit. Approximation Algorithms for (S,T)-Connectivity Problems.

Degree: 2010, University of Waterloo

 We study a directed network design problem called the k-(S,T)-connectivity problem; we design and analyze approximation algorithms and give hardness results. For each positive integer… (more)

Subjects/Keywords: algorithm; approximation algorithm; connectivity; directed graph

…2.5 The illustration of the working of our 2-approximation algorithm for the standard (… …2.6 The illustration of the working of our approximation algorithm for the relaxed (S… …approximation algorithm for the edge-connectivity problem in both directed and undirected graphs. The… …O(log k)-approximation algorithm was claimed by Ravi and Williamson [66, 67… …algorithm with an approximation guarantee of O(log k) for the special case where n < 6k… 

Page 1 Page 2 Page 3 Page 4 Page 5 Page 6 Page 7

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Laekhanukit, B. (2010). Approximation Algorithms for (S,T)-Connectivity Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5321

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/5321.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Laekhanukit, Bundit. “Approximation Algorithms for (S,T)-Connectivity Problems.” 2010. Web. 08 Dec 2019.

Vancouver:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/5321.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Laekhanukit B. Approximation Algorithms for (S,T)-Connectivity Problems. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5321

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

14. Demontigny, Philippe. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.

Degree: 2016, University of Waterloo

 In this thesis, we study drawings of maximal outerplanar graphs that place vertices on integer coordinates. We introduce a new class of graphs, called umbrellas,… (more)

Subjects/Keywords: Approximation Algorithm; Outerplanar Graph; Layered Drawing; Umbrella; Umbrella System; Umbrella Depth; Height; Flat Visibility Representation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Demontigny, P. (2016). A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10652

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Demontigny, Philippe. “A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.” 2016. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/10652.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Demontigny, Philippe. “A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings.” 2016. Web. 08 Dec 2019.

Vancouver:

Demontigny P. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/10652.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Demontigny P. A 2-Approximation for the Height of Maximal Outerplanar Graph Drawings. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10652

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

15. Marston, Andrew James. Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation.

Degree: 2010, University of Waterloo

 This thesis is a study of the geometric design of solar concentrating collectors. In this work, a numerical optimization methodology was developed and applied to… (more)

Subjects/Keywords: Numerical Optimization; Monte Carlo methods; Solar Energy; Solar Concentration; stochastic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Marston, A. J. (2010). Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/5589

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Marston, Andrew James. “Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation.” 2010. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/5589.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Marston, Andrew James. “Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation.” 2010. Web. 08 Dec 2019.

Vancouver:

Marston AJ. Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation. [Internet] [Thesis]. University of Waterloo; 2010. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/5589.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Marston AJ. Geometric Optimization of Solar Concentrating Collectors using Quasi-Monte Carlo Simulation. [Thesis]. University of Waterloo; 2010. Available from: http://hdl.handle.net/10012/5589

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

16. Chung, Kelvin. Using integer programming in finding t-designs.

Degree: 2012, University of Waterloo

 A t-design is a combinatorial structure consisting of a collection of blocks over a set of points satisfying certain properties. The existence of t-designs given… (more)

Subjects/Keywords: t-design; integer programming; Kramer-Mesner method; Linton's algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Chung, K. (2012). Using integer programming in finding t-designs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6657

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Chung, Kelvin. “Using integer programming in finding t-designs.” 2012. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/6657.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Chung, Kelvin. “Using integer programming in finding t-designs.” 2012. Web. 08 Dec 2019.

Vancouver:

Chung K. Using integer programming in finding t-designs. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/6657.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Chung K. Using integer programming in finding t-designs. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6657

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

17. Ahmed, Mustaq. Constrained Shortest Paths in Terrains and Graphs.

Degree: 2009, University of Waterloo

 Finding a shortest path is one of the most well-studied optimization problems. In this thesis we focus on shortest paths in geometric and graph theoretic… (more)

Subjects/Keywords: Computational Geometry; Graph, Algorithm; Approximation; Optimization; Robotics; Forbidden path

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ahmed, M. (2009). Constrained Shortest Paths in Terrains and Graphs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/4825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ahmed, Mustaq. “Constrained Shortest Paths in Terrains and Graphs.” 2009. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/4825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ahmed, Mustaq. “Constrained Shortest Paths in Terrains and Graphs.” 2009. Web. 08 Dec 2019.

Vancouver:

Ahmed M. Constrained Shortest Paths in Terrains and Graphs. [Internet] [Thesis]. University of Waterloo; 2009. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/4825.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ahmed M. Constrained Shortest Paths in Terrains and Graphs. [Thesis]. University of Waterloo; 2009. Available from: http://hdl.handle.net/10012/4825

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

18. Simjour, Narges. A New Optimality Measure for Distance Dominating Sets.

Degree: 2006, University of Waterloo

 We study the problem of finding the smallest power of an input graph that has k disjoint dominating sets, where the ith power of an… (more)

Subjects/Keywords: Computer Science; distance dominating set; domatic number; approximation algorithm; exact algorithm; spanner

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Simjour, N. (2006). A New Optimality Measure for Distance Dominating Sets. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Simjour, Narges. “A New Optimality Measure for Distance Dominating Sets.” 2006. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/2941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Simjour, Narges. “A New Optimality Measure for Distance Dominating Sets.” 2006. Web. 08 Dec 2019.

Vancouver:

Simjour N. A New Optimality Measure for Distance Dominating Sets. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/2941.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Simjour N. A New Optimality Measure for Distance Dominating Sets. [Thesis]. University of Waterloo; 2006. Available from: http://hdl.handle.net/10012/2941

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

19. Alharbi , Talal Khalaf. Energy Management and Smart Charging of PEVs in Isolated Microgrids.

Degree: 2015, University of Waterloo

 Microgrids are defined as a cluster of loads and micro-resources operating as a single controllable entity that provides both power and heat to its local… (more)

Subjects/Keywords: demand response; energy management system; isolated microgrid; optimal power flow; stochastic programming; smart charging.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alharbi , T. K. (2015). Energy Management and Smart Charging of PEVs in Isolated Microgrids. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9707

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Alharbi , Talal Khalaf. “Energy Management and Smart Charging of PEVs in Isolated Microgrids.” 2015. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/9707.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Alharbi , Talal Khalaf. “Energy Management and Smart Charging of PEVs in Isolated Microgrids.” 2015. Web. 08 Dec 2019.

Vancouver:

Alharbi TK. Energy Management and Smart Charging of PEVs in Isolated Microgrids. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/9707.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alharbi TK. Energy Management and Smart Charging of PEVs in Isolated Microgrids. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9707

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

20. Alnaggar, Aliaa. Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach.

Degree: 2017, University of Waterloo

 The distribution planning problem with consolidation center(s) addresses the coordination of distribution activities between a set of suppliers and a set of customers, through the… (more)

Subjects/Keywords: logistics; distribution; supply chain; stochastic programming; Bender's decomposition; 3PL; network optimization; shipment consolidation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Alnaggar, A. (2017). Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/12331

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Alnaggar, Aliaa. “Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach.” 2017. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/12331.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Alnaggar, Aliaa. “Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach.” 2017. Web. 08 Dec 2019.

Vancouver:

Alnaggar A. Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach. [Internet] [Thesis]. University of Waterloo; 2017. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/12331.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Alnaggar A. Distribution Planning with Consolidation - A Two-Stage Stochastic Programming Approach. [Thesis]. University of Waterloo; 2017. Available from: http://hdl.handle.net/10012/12331

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

21. Mousavi, Nima. Algorithmic Problems in Access Control.

Degree: 2014, University of Waterloo

 Access control is used to provide regulated access to resources by principals. It is an important and foundational aspect of information security. Role-Based Access Control… (more)

Subjects/Keywords: Access Control; Role based Access Control; User Authorization Query Problem; Cascade Bloom Filter; Complexity; NP-hard; Algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mousavi, N. (2014). Algorithmic Problems in Access Control. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/8303

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mousavi, Nima. “Algorithmic Problems in Access Control.” 2014. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/8303.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mousavi, Nima. “Algorithmic Problems in Access Control.” 2014. Web. 08 Dec 2019.

Vancouver:

Mousavi N. Algorithmic Problems in Access Control. [Internet] [Thesis]. University of Waterloo; 2014. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/8303.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mousavi N. Algorithmic Problems in Access Control. [Thesis]. University of Waterloo; 2014. Available from: http://hdl.handle.net/10012/8303

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

22. Gao, Zhihan. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.

Degree: 2015, University of Waterloo

 Linear programming (LP) relaxations provide a powerful technique to design approximation algorithms for combinatorial optimization problems. In the first part of the thesis, we study… (more)

Subjects/Keywords: Approximation algorithms; Path Traveling Salesman Problem; Asymmetric Traveling Salesman Problem; Tree Augmentation Problem; Linear programming relaxations; Lift-and-Project systems

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Gao, Z. (2015). Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/9492

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Gao, Zhihan. “Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.” 2015. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/9492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Gao, Zhihan. “Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations.” 2015. Web. 08 Dec 2019.

Vancouver:

Gao Z. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. [Internet] [Thesis]. University of Waterloo; 2015. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/9492.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Gao Z. Approximation Algorithms for Path TSP, ATSP, and TAP via Relaxations. [Thesis]. University of Waterloo; 2015. Available from: http://hdl.handle.net/10012/9492

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

23. Zhu, Dian. General Quadratic Risk Minimization: a Variational Approach.

Degree: 2016, University of Waterloo

 Mean-variance portfolio selection and mean-variance hedging are mainstream research topics in mathematical nance, which can be subsumed within the framework of a general problem of… (more)

Subjects/Keywords: quadratic loss minimization; portfolio selection; American wealth constraint; European wealth constraint; Portfolio constraint; Stochastic Control; Convex optimization; Conjugate duality; Slater condition; Singular linear functionals; Lagrange multipliers; variational approach

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Zhu, D. (2016). General Quadratic Risk Minimization: a Variational Approach. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/10574

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Zhu, Dian. “General Quadratic Risk Minimization: a Variational Approach.” 2016. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/10574.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Zhu, Dian. “General Quadratic Risk Minimization: a Variational Approach.” 2016. Web. 08 Dec 2019.

Vancouver:

Zhu D. General Quadratic Risk Minimization: a Variational Approach. [Internet] [Thesis]. University of Waterloo; 2016. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/10574.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Zhu D. General Quadratic Risk Minimization: a Variational Approach. [Thesis]. University of Waterloo; 2016. Available from: http://hdl.handle.net/10012/10574

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

24. Mahmood, Abdullah-Al. Approximation Algorithms for Rectangle Piercing Problems.

Degree: 2005, University of Waterloo

 Piercing problems arise often in facility location, which is a well-studied area of computational geometry. The general form of the piercing problem discussed in this… (more)

Subjects/Keywords: Computer Science; piercing; stabbing; algorithm; approximation algorithm; approximation scheme; PTAS; shifting; rectangle; interval piercing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Mahmood, A. (2005). Approximation Algorithms for Rectangle Piercing Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1025

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Mahmood, Abdullah-Al. “Approximation Algorithms for Rectangle Piercing Problems.” 2005. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/1025.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Mahmood, Abdullah-Al. “Approximation Algorithms for Rectangle Piercing Problems.” 2005. Web. 08 Dec 2019.

Vancouver:

Mahmood A. Approximation Algorithms for Rectangle Piercing Problems. [Internet] [Thesis]. University of Waterloo; 2005. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/1025.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Mahmood A. Approximation Algorithms for Rectangle Piercing Problems. [Thesis]. University of Waterloo; 2005. Available from: http://hdl.handle.net/10012/1025

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

25. Asadzadeh Esfahani, Masoud. Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems.

Degree: 2012, University of Waterloo

 In the current water resources scientific literature, a wide variety of engineering design problems are solved in a simulation-optimization framework. These problems can have single… (more)

Subjects/Keywords: Optimization; Algorithm Parsimony; Limited Computational Budget; Convex Hull Contribution

…objective minimization problems and the Convex approximation of Pareto front based on these points… …modifications that distinguish discrete DDS from DDS. The DDS algorithm is a simple, stochastic… …5.2.2 Convex Hull Contribution (CHC) Selection Metric 5.3 Numerical Experiments… …versus HVC for Mathematical Problems with Convex Pareto Front 93 5.4.2 PA-DDS Performance… …the end of each step of the HD-DDS algorithm (see appendix A-Figure A5) versus… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Asadzadeh Esfahani, M. (2012). Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/7133

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Asadzadeh Esfahani, Masoud. “Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems.” 2012. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/7133.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Asadzadeh Esfahani, Masoud. “Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems.” 2012. Web. 08 Dec 2019.

Vancouver:

Asadzadeh Esfahani M. Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/7133.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Asadzadeh Esfahani M. Developing Parsimonious and Efficient Algorithms for Water Resources Optimization Problems. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/7133

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

26. Schmid, Matthew. Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture.

Degree: 2012, University of Waterloo

 This thesis attempts to resolve the contradictory relationship between the ecological merits of wood construction and the significant material intensity of recent free form timber… (more)

Subjects/Keywords: timber surface architecture; timber shell structures; stochastic process; generative algorithm; generative design; morphogenetic design; structural optimization; geodesic curves; freeform; material efficiency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Schmid, M. (2012). Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/6723

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Schmid, Matthew. “Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture.” 2012. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/6723.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Schmid, Matthew. “Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture.” 2012. Web. 08 Dec 2019.

Vancouver:

Schmid M. Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture. [Internet] [Thesis]. University of Waterloo; 2012. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/6723.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Schmid M. Stochastic Lattice | A Generative Design Tool for Material Conscious Free Form Timber Surface Architecture. [Thesis]. University of Waterloo; 2012. Available from: http://hdl.handle.net/10012/6723

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

27. Potaptchik, Marina. Portfolio Selection Under Nonsmooth Convex Transaction Costs.

Degree: 2006, University of Waterloo

 We consider a portfolio selection problem in the presence of transaction costs. Transaction costs on each asset are assumed to be a convex function of… (more)

Subjects/Keywords: Mathematics; Convex programming; piecewise differentiable functions; portfolio optimization; transaction costs.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Potaptchik, M. (2006). Portfolio Selection Under Nonsmooth Convex Transaction Costs. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2940

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Potaptchik, Marina. “Portfolio Selection Under Nonsmooth Convex Transaction Costs.” 2006. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/2940.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Potaptchik, Marina. “Portfolio Selection Under Nonsmooth Convex Transaction Costs.” 2006. Web. 08 Dec 2019.

Vancouver:

Potaptchik M. Portfolio Selection Under Nonsmooth Convex Transaction Costs. [Internet] [Thesis]. University of Waterloo; 2006. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/2940.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Potaptchik M. Portfolio Selection Under Nonsmooth Convex Transaction Costs. [Thesis]. University of Waterloo; 2006. Available from: http://hdl.handle.net/10012/2940

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

28. Ferreira Fialho dos Anjos, Miguel Nuno. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems.

Degree: 2001, University of Waterloo

 It is well known that many of the optimization problems which arise in applications are <I>hard</I>, which usually means that they are NP-hard. Hence much… (more)

Subjects/Keywords: Mathematics; Maximum Cut Problem; VLSI Layout Problem; Semidefinite Programming; Convex Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ferreira Fialho dos Anjos, M. N. (2001). New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/1138

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ferreira Fialho dos Anjos, Miguel Nuno. “New Convex Relaxations for the Maximum Cut and VLSI Layout Problems.” 2001. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/1138.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ferreira Fialho dos Anjos, Miguel Nuno. “New Convex Relaxations for the Maximum Cut and VLSI Layout Problems.” 2001. Web. 08 Dec 2019.

Vancouver:

Ferreira Fialho dos Anjos MN. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. [Internet] [Thesis]. University of Waterloo; 2001. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/1138.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ferreira Fialho dos Anjos MN. New Convex Relaxations for the Maximum Cut and VLSI Layout Problems. [Thesis]. University of Waterloo; 2001. Available from: http://hdl.handle.net/10012/1138

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

29. Ghaddar, Bissan. A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.

Degree: 2007, University of Waterloo

 The minimum k-partition (MkP) problem is a well-known optimization problem encountered in various applications most notably in telecommunication and physics. Formulated in the early 1990s… (more)

Subjects/Keywords: Minimum k-Partition; Convex Optimization; Semidefinite Programming; Branch-and-Cut

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

Ghaddar, B. (2007). A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/2766

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

Ghaddar, Bissan. “A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.” 2007. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/2766.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

Ghaddar, Bissan. “A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem.” 2007. Web. 08 Dec 2019.

Vancouver:

Ghaddar B. A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. [Internet] [Thesis]. University of Waterloo; 2007. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/2766.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

Ghaddar B. A Branch-and-Cut Algorithm based on Semidefinite Programming for the Minimum k-Partition Problem. [Thesis]. University of Waterloo; 2007. Available from: http://hdl.handle.net/10012/2766

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation


University of Waterloo

30. ZHENG, HONGHAO. Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models.

Degree: 2019, University of Waterloo

 The accuracy of the model used for prediction in Nonlinear Model Predictive Controller (NMPC) is one of the main factors affecting the closed loop performance.… (more)

Subjects/Keywords: model predictive control; dynamic metabolic flux models; bioreactor; convex cone method; robust NMPC; economic MPC; tableau based tree; linear programming; right hand side; sensitivity analysis; RHS map

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

APA · Chicago · MLA · Vancouver · CSE | Export to Zotero / EndNote / Reference Manager

APA (6th Edition):

ZHENG, H. (2019). Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/14630

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Chicago Manual of Style (16th Edition):

ZHENG, HONGHAO. “Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models.” 2019. Thesis, University of Waterloo. Accessed December 08, 2019. http://hdl.handle.net/10012/14630.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

MLA Handbook (7th Edition):

ZHENG, HONGHAO. “Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models.” 2019. Web. 08 Dec 2019.

Vancouver:

ZHENG H. Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models. [Internet] [Thesis]. University of Waterloo; 2019. [cited 2019 Dec 08]. Available from: http://hdl.handle.net/10012/14630.

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

Council of Science Editors:

ZHENG H. Robust Nonlinear Model Predictive Control of Biosystems described by Dynamic Metabolic Flux Models. [Thesis]. University of Waterloo; 2019. Available from: http://hdl.handle.net/10012/14630

Note: this citation may be lacking information needed for this citation format:
Not specified: Masters Thesis or Doctoral Dissertation

[1] [2] [3] [4] [5] … [14]

.