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

Level: masters

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

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

Search Limiters

Last 2 Years | English Only

Degrees

Languages

Country

▼ Search Limiters


McMaster University

1. Griscik, Michael Paul. A New Algorithm for Stochastic Approximation.

Degree: MEngr, 1970, McMaster University

A review of Stochastic Approximation and the major contributions to the area is made. A proof of convergence for the algorithm is developed. An… (more)

Subjects/Keywords: stochastic; algorithm; approximation; convergence; optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Griscik, M. P. (1970). A New Algorithm for Stochastic Approximation. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/17894

Chicago Manual of Style (16th Edition):

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Masters Thesis, McMaster University. Accessed December 11, 2019. http://hdl.handle.net/11375/17894.

MLA Handbook (7th Edition):

Griscik, Michael Paul. “A New Algorithm for Stochastic Approximation.” 1970. Web. 11 Dec 2019.

Vancouver:

Griscik MP. A New Algorithm for Stochastic Approximation. [Internet] [Masters thesis]. McMaster University; 1970. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11375/17894.

Council of Science Editors:

Griscik MP. A New Algorithm for Stochastic Approximation. [Masters Thesis]. McMaster University; 1970. Available from: http://hdl.handle.net/11375/17894


Virginia Tech

2. Ojha, Abhi. Coupled Natural Gas and Electric Power Systems.

Degree: MS, Electrical and Computer Engineering, 2017, Virginia Tech

 Decreasing gas prices and the pressing need for fast-responding electric power generators are currently transforming natural gas networks. The intermittent operation of gas-fired plants to… (more)

Subjects/Keywords: Successive convex approximation; semidefinite programming; feasible point pursuit; alternating direction method of multipliers

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ojha, A. (2017). Coupled Natural Gas and Electric Power Systems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78666

Chicago Manual of Style (16th Edition):

Ojha, Abhi. “Coupled Natural Gas and Electric Power Systems.” 2017. Masters Thesis, Virginia Tech. Accessed December 11, 2019. http://hdl.handle.net/10919/78666.

MLA Handbook (7th Edition):

Ojha, Abhi. “Coupled Natural Gas and Electric Power Systems.” 2017. Web. 11 Dec 2019.

Vancouver:

Ojha A. Coupled Natural Gas and Electric Power Systems. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10919/78666.

Council of Science Editors:

Ojha A. Coupled Natural Gas and Electric Power Systems. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/78666


University of Florida

3. Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets.

Degree: MS, Industrial and Systems Engineering, 2011, University of Florida

 We study the polyhedral structure of an integer bilinear covering set, which appears in the formulation of various practical problems including staff scheduling. Starting from… (more)

Subjects/Keywords: Algorithms; Integers; Linear programming; Mathematical models; Mathematical variables; Mathematics; Matrices; Objective functions; Operations research; Optimal solutions; bilinear  – convex  – facet  – hull  – integer  – nonconvex  – optimzatioin  – polyhedral  – relaxations

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Garg,Nitish. (2011). A Polyhedral Study of Integer Bilinear Covering Sets. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0042952

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Chicago Manual of Style (16th Edition):

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Masters Thesis, University of Florida. Accessed December 11, 2019. http://ufdc.ufl.edu/UFE0042952.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

MLA Handbook (7th Edition):

Garg,Nitish. “A Polyhedral Study of Integer Bilinear Covering Sets.” 2011. Web. 11 Dec 2019.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Vancouver:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Internet] [Masters thesis]. University of Florida; 2011. [cited 2019 Dec 11]. Available from: http://ufdc.ufl.edu/UFE0042952.

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete

Council of Science Editors:

Garg,Nitish. A Polyhedral Study of Integer Bilinear Covering Sets. [Masters Thesis]. University of Florida; 2011. Available from: http://ufdc.ufl.edu/UFE0042952

Note: this citation may be lacking information needed for this citation format:
Author name may be incomplete


University of Pretoria

4. Conradie, David Gideon. Scheduling coal handling processes using metaheuristics.

Degree: Industrial and Systems Engineering, 2011, University of Pretoria

 The operational scheduling at coal handling facilities is of the utmost importance to ensure that the coal consuming processes are supplied with a constant feed… (more)

Subjects/Keywords: Scheduling; Simulated annealing; Metaheuristics; Approximation algorithms; Multiple-objective programming; Stochastic programming; Industry application; Coal handling; Coal blending; Coal homogenization; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Conradie, D. (2011). Scheduling coal handling processes using metaheuristics. (Masters Thesis). University of Pretoria. Retrieved from http://hdl.handle.net/2263/24046

Chicago Manual of Style (16th Edition):

Conradie, David. “Scheduling coal handling processes using metaheuristics.” 2011. Masters Thesis, University of Pretoria. Accessed December 11, 2019. http://hdl.handle.net/2263/24046.

MLA Handbook (7th Edition):

Conradie, David. “Scheduling coal handling processes using metaheuristics.” 2011. Web. 11 Dec 2019.

Vancouver:

Conradie D. Scheduling coal handling processes using metaheuristics. [Internet] [Masters thesis]. University of Pretoria; 2011. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2263/24046.

Council of Science Editors:

Conradie D. Scheduling coal handling processes using metaheuristics. [Masters Thesis]. University of Pretoria; 2011. Available from: http://hdl.handle.net/2263/24046


University of Pretoria

5. [No author]. Scheduling coal handling processes using metaheuristics .

Degree: 2011, University of Pretoria

 The operational scheduling at coal handling facilities is of the utmost importance to ensure that the coal consuming processes are supplied with a constant feed… (more)

Subjects/Keywords: Scheduling; Simulated annealing; Metaheuristics; Approximation algorithms; Multiple-objective programming; Stochastic programming; Industry application; Coal handling; Coal blending; Coal homogenization; UCTD

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

author], [. (2011). Scheduling coal handling processes using metaheuristics . (Masters Thesis). University of Pretoria. Retrieved from http://upetd.up.ac.za/thesis/available/etd-04212008-101917/

Chicago Manual of Style (16th Edition):

author], [No. “Scheduling coal handling processes using metaheuristics .” 2011. Masters Thesis, University of Pretoria. Accessed December 11, 2019. http://upetd.up.ac.za/thesis/available/etd-04212008-101917/.

MLA Handbook (7th Edition):

author], [No. “Scheduling coal handling processes using metaheuristics .” 2011. Web. 11 Dec 2019.

Vancouver:

author] [. Scheduling coal handling processes using metaheuristics . [Internet] [Masters thesis]. University of Pretoria; 2011. [cited 2019 Dec 11]. Available from: http://upetd.up.ac.za/thesis/available/etd-04212008-101917/.

Council of Science Editors:

author] [. Scheduling coal handling processes using metaheuristics . [Masters Thesis]. University of Pretoria; 2011. Available from: http://upetd.up.ac.za/thesis/available/etd-04212008-101917/


McMaster University

6. Tikk, Alexander. Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty.

Degree: MASc, 2019, McMaster University

This thesis examines the optimal scheduling of a hydroelectric power plant with cascaded reservoirs each with multiple generating units under uncertainty after testing three linearization… (more)

Subjects/Keywords: Hydropower/Hydroelectric; Uncertainty; Linearization; Scheduling; Optimization; Mixed-Integer Nonlinear Programming Problem (MINLP); Mixed-Integer Linear Programming Problem (MILP); Successive Linear Programming (SLP); Piecewise Linear Approximations (PLA); Stochastic; Nervousness; Rolling Horizon; Cascaded Reservoirs; Hybrid; nonconvex; Start-up costs; Generators

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Tikk, A. (2019). Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty. (Masters Thesis). McMaster University. Retrieved from http://hdl.handle.net/11375/23995

Chicago Manual of Style (16th Edition):

Tikk, Alexander. “Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty.” 2019. Masters Thesis, McMaster University. Accessed December 11, 2019. http://hdl.handle.net/11375/23995.

MLA Handbook (7th Edition):

Tikk, Alexander. “Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty.” 2019. Web. 11 Dec 2019.

Vancouver:

Tikk A. Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty. [Internet] [Masters thesis]. McMaster University; 2019. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11375/23995.

Council of Science Editors:

Tikk A. Linearization-Based Strategies for Optimal Scheduling of a Hydroelectric Power Plant Under Uncertainty. [Masters Thesis]. McMaster University; 2019. Available from: http://hdl.handle.net/11375/23995


McGill University

7. Fraklin, Martin Gordon. Convex programming without constraint qualification : a study of Pareto optimality.

Degree: MS, Department of Mathematics, 1975, McGill University

Subjects/Keywords: Convex programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fraklin, M. G. (1975). Convex programming without constraint qualification : a study of Pareto optimality. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile45990.pdf

Chicago Manual of Style (16th Edition):

Fraklin, Martin Gordon. “Convex programming without constraint qualification : a study of Pareto optimality.” 1975. Masters Thesis, McGill University. Accessed December 11, 2019. http://digitool.library.mcgill.ca/thesisfile45990.pdf.

MLA Handbook (7th Edition):

Fraklin, Martin Gordon. “Convex programming without constraint qualification : a study of Pareto optimality.” 1975. Web. 11 Dec 2019.

Vancouver:

Fraklin MG. Convex programming without constraint qualification : a study of Pareto optimality. [Internet] [Masters thesis]. McGill University; 1975. [cited 2019 Dec 11]. Available from: http://digitool.library.mcgill.ca/thesisfile45990.pdf.

Council of Science Editors:

Fraklin MG. Convex programming without constraint qualification : a study of Pareto optimality. [Masters Thesis]. McGill University; 1975. Available from: http://digitool.library.mcgill.ca/thesisfile45990.pdf


McGill University

8. Turner, Bella Tobie. Solving discrete minimax problems with constraints.

Degree: MS, Department of Mathematics, 1976, McGill University

Subjects/Keywords: Convex programming.

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Turner, B. T. (1976). Solving discrete minimax problems with constraints. (Masters Thesis). McGill University. Retrieved from http://digitool.library.mcgill.ca/thesisfile52023.pdf

Chicago Manual of Style (16th Edition):

Turner, Bella Tobie. “Solving discrete minimax problems with constraints.” 1976. Masters Thesis, McGill University. Accessed December 11, 2019. http://digitool.library.mcgill.ca/thesisfile52023.pdf.

MLA Handbook (7th Edition):

Turner, Bella Tobie. “Solving discrete minimax problems with constraints.” 1976. Web. 11 Dec 2019.

Vancouver:

Turner BT. Solving discrete minimax problems with constraints. [Internet] [Masters thesis]. McGill University; 1976. [cited 2019 Dec 11]. Available from: http://digitool.library.mcgill.ca/thesisfile52023.pdf.

Council of Science Editors:

Turner BT. Solving discrete minimax problems with constraints. [Masters Thesis]. McGill University; 1976. Available from: http://digitool.library.mcgill.ca/thesisfile52023.pdf


University of Florida

9. Su, Suiyi. Sample Path Based Optimal Position Liquidation with CVaR Risk.

Degree: MS, Industrial and Systems Engineering, 2012, University of Florida

 The purpose of this research is to investigate devising theoptimal position liquidation strategies in financial markets. During the transaction of large block orders, investors need… (more)

Subjects/Keywords: Anticipation; Assets; Datasets; Market prices; Mathematical monotonicity; Mathematics; Matrices; Objective functions; Prices; Real prices; convex  – execution  – guard  – nonanticipativity  – optimal  – portfolio  – programming  – safe  – stochastic  – trading

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Su, S. (2012). Sample Path Based Optimal Position Liquidation with CVaR Risk. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0044708

Chicago Manual of Style (16th Edition):

Su, Suiyi. “Sample Path Based Optimal Position Liquidation with CVaR Risk.” 2012. Masters Thesis, University of Florida. Accessed December 11, 2019. http://ufdc.ufl.edu/UFE0044708.

MLA Handbook (7th Edition):

Su, Suiyi. “Sample Path Based Optimal Position Liquidation with CVaR Risk.” 2012. Web. 11 Dec 2019.

Vancouver:

Su S. Sample Path Based Optimal Position Liquidation with CVaR Risk. [Internet] [Masters thesis]. University of Florida; 2012. [cited 2019 Dec 11]. Available from: http://ufdc.ufl.edu/UFE0044708.

Council of Science Editors:

Su S. Sample Path Based Optimal Position Liquidation with CVaR Risk. [Masters Thesis]. University of Florida; 2012. Available from: http://ufdc.ufl.edu/UFE0044708


Rutgers University

10. Xu, Chuan. Simulation approach to two-stage bond portfolio optimization problem.

Degree: MS, Operations Research, 2014, Rutgers University

 Studies on two sides are done in this thesis. First, we consider bond portfolio optimization problem under stochastic optimization structure; second, specific algorithm to solve… (more)

Subjects/Keywords: Stochastic programming; Portfolio management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xu, C. (2014). Simulation approach to two-stage bond portfolio optimization problem. (Masters Thesis). Rutgers University. Retrieved from https://rucore.libraries.rutgers.edu/rutgers-lib/44321/

Chicago Manual of Style (16th Edition):

Xu, Chuan. “Simulation approach to two-stage bond portfolio optimization problem.” 2014. Masters Thesis, Rutgers University. Accessed December 11, 2019. https://rucore.libraries.rutgers.edu/rutgers-lib/44321/.

MLA Handbook (7th Edition):

Xu, Chuan. “Simulation approach to two-stage bond portfolio optimization problem.” 2014. Web. 11 Dec 2019.

Vancouver:

Xu C. Simulation approach to two-stage bond portfolio optimization problem. [Internet] [Masters thesis]. Rutgers University; 2014. [cited 2019 Dec 11]. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44321/.

Council of Science Editors:

Xu C. Simulation approach to two-stage bond portfolio optimization problem. [Masters Thesis]. Rutgers University; 2014. Available from: https://rucore.libraries.rutgers.edu/rutgers-lib/44321/

11. Britt, Justin William. Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms.

Degree: MA, Industrial and Manufacturing Systems Engineering, 2015, University of Windsor

 Health care systems in Canada provide benefits to patients but have issues with costs and wait lists. Long wait lists negatively affect patients’ welfares. This… (more)

Subjects/Keywords: goal programming; health service; scheduling; stochastic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Britt, J. W. (2015). Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms. (Masters Thesis). University of Windsor. Retrieved from https://scholar.uwindsor.ca/etd/5629

Chicago Manual of Style (16th Edition):

Britt, Justin William. “Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms.” 2015. Masters Thesis, University of Windsor. Accessed December 11, 2019. https://scholar.uwindsor.ca/etd/5629.

MLA Handbook (7th Edition):

Britt, Justin William. “Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms.” 2015. Web. 11 Dec 2019.

Vancouver:

Britt JW. Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms. [Internet] [Masters thesis]. University of Windsor; 2015. [cited 2019 Dec 11]. Available from: https://scholar.uwindsor.ca/etd/5629.

Council of Science Editors:

Britt JW. Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms. [Masters Thesis]. University of Windsor; 2015. Available from: https://scholar.uwindsor.ca/etd/5629


San Jose State University

12. Zhou, Siqiong. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.

Degree: MS, Industrial and Systems Engineering, 2019, San Jose State University

  Wildland-urban interface wildfires have been a significant threat in many countries. This thesis presents an integer two-stage stochastic goal programming model for comprehensive, efficient… (more)

Subjects/Keywords: Goal programming; Stochastic programming; Wildfire management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, S. (2019). A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. (Masters Thesis). San Jose State University. Retrieved from https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022

Chicago Manual of Style (16th Edition):

Zhou, Siqiong. “A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.” 2019. Masters Thesis, San Jose State University. Accessed December 11, 2019. https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022.

MLA Handbook (7th Edition):

Zhou, Siqiong. “A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation.” 2019. Web. 11 Dec 2019.

Vancouver:

Zhou S. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. [Internet] [Masters thesis]. San Jose State University; 2019. [cited 2019 Dec 11]. Available from: https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022.

Council of Science Editors:

Zhou S. A Spatial Optimization Model for Resource Allocation for Wildfire Suppression and Resident Evacuation. [Masters Thesis]. San Jose State University; 2019. Available from: https://doi.org/10.31979/etd.x8dn-588y ; https://scholarworks.sjsu.edu/etd_theses/5022


Virginia Tech

13. Wessels, Mariette Christine. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.

Degree: MS, Mathematics, 2017, Virginia Tech

 Given a set of n points on a plane, in the Minimum Weight Triangulation problem, we wish to find a triangulation that minimizes the sum… (more)

Subjects/Keywords: Minimum Weight Triangulation; Approximation Algorithm; Geometric Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wessels, M. C. (2017). A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/77933

Chicago Manual of Style (16th Edition):

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Masters Thesis, Virginia Tech. Accessed December 11, 2019. http://hdl.handle.net/10919/77933.

MLA Handbook (7th Edition):

Wessels, Mariette Christine. “A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem.” 2017. Web. 11 Dec 2019.

Vancouver:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Internet] [Masters thesis]. Virginia Tech; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10919/77933.

Council of Science Editors:

Wessels MC. A Grid-Based Approximation Algorithm for the Minimum Weight Triangulation Problem. [Masters Thesis]. Virginia Tech; 2017. Available from: http://hdl.handle.net/10919/77933


Virginia Tech

14. Wang, Hongjie. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.

Degree: MS, Industrial and Systems Engineering, 1998, Virginia Tech

 The primary objective of this thesis is to develop and implement a global optimization algorithm to solve a class of nonconvex programming problems, and to… (more)

Subjects/Keywords: nonconvex programming; global optimization; nonlinear programming; RLT

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wang, H. (1998). Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/36823

Chicago Manual of Style (16th Edition):

Wang, Hongjie. “Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.” 1998. Masters Thesis, Virginia Tech. Accessed December 11, 2019. http://hdl.handle.net/10919/36823.

MLA Handbook (7th Edition):

Wang, Hongjie. “Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems.” 1998. Web. 11 Dec 2019.

Vancouver:

Wang H. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. [Internet] [Masters thesis]. Virginia Tech; 1998. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10919/36823.

Council of Science Editors:

Wang H. Global Optimization of Nonconvex Factorable Programs with Applications to Engineering Design Problems. [Masters Thesis]. Virginia Tech; 1998. Available from: http://hdl.handle.net/10919/36823

15. Deklerck, M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.

Degree: 2016, Delft University of Technology

 Structural optimization, first introduced by Schmidt in 1960, is a rapid growing factor in the development of new aerospace structures. This growth is established by… (more)

Subjects/Keywords: structural optimization; stiffened panel; interior point method; conservative approximation; sequential convex programming

…ConLin [6] is a convex linearisation algorithm developed by C.Fleury in 1989 and was… …Sequential Convex Programming (SCP) and is further discussed in the next section. (… …programming Sequential Convex Programming (SCP) also finds its origin in the CONLIN… …programming problem as specified by Schittkowski [40], where B k is the approximation of… …4.2.2 Approximation of the primal problem . . . . . . . . . . . . . . . . . . . 41 4.2.3… 

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Deklerck, M. (2016). Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1

Chicago Manual of Style (16th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Masters Thesis, Delft University of Technology. Accessed December 11, 2019. http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

MLA Handbook (7th Edition):

Deklerck, M. “Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:.” 2016. Web. 11 Dec 2019.

Vancouver:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Internet] [Masters thesis]. Delft University of Technology; 2016. [cited 2019 Dec 11]. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1.

Council of Science Editors:

Deklerck M. Optimization of stiffened panels using a combination of FEM and a predictor-corrector interior point method:. [Masters Thesis]. Delft University of Technology; 2016. Available from: http://resolver.tudelft.nl/uuid:d0715121-d6d3-4816-95b1-4254af5a75c1


Western Kentucky University

16. Cheng, Gang. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.

Degree: MS, Department of Mathematics, 2013, Western Kentucky University

Stochastic dynamic programming is a recursive method for solving sequential or multistage decision problems. It helps economists and mathematicians construct and solve a huge… (more)

Subjects/Keywords: Dynamic Programming; Stochastic Programming; Stochastic Control Theory; Stochastic Differential Equations; Stochastic Analysis; Martingales (Mathematics); Analysis; Applied Mathematics; Mathematics; Statistics and Probability

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheng, G. (2013). Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. (Masters Thesis). Western Kentucky University. Retrieved from https://digitalcommons.wku.edu/theses/1236

Chicago Manual of Style (16th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Masters Thesis, Western Kentucky University. Accessed December 11, 2019. https://digitalcommons.wku.edu/theses/1236.

MLA Handbook (7th Edition):

Cheng, Gang. “Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains.” 2013. Web. 11 Dec 2019.

Vancouver:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Internet] [Masters thesis]. Western Kentucky University; 2013. [cited 2019 Dec 11]. Available from: https://digitalcommons.wku.edu/theses/1236.

Council of Science Editors:

Cheng G. Analyzing and Solving Non-Linear Stochastic Dynamic Models on Non-Periodic Discrete Time Domains. [Masters Thesis]. Western Kentucky University; 2013. Available from: https://digitalcommons.wku.edu/theses/1236


Delft University of Technology

17. Van Vliet, E. Axisymmetrical topology optimization of an FPSO main bearing support structure:.

Degree: 2015, Delft University of Technology

A study in the application of topology optimization to problems of realtive nature, as found in the load distribution within an FPSO main bearing. Advisors/Committee Members: L. Kiminski, M..

Subjects/Keywords: topology optimization; structural mechanics; relative constraints; method of moving asymptotes; FPSO; convex approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Van Vliet, E. (2015). Axisymmetrical topology optimization of an FPSO main bearing support structure:. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561

Chicago Manual of Style (16th Edition):

Van Vliet, E. “Axisymmetrical topology optimization of an FPSO main bearing support structure:.” 2015. Masters Thesis, Delft University of Technology. Accessed December 11, 2019. http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561.

MLA Handbook (7th Edition):

Van Vliet, E. “Axisymmetrical topology optimization of an FPSO main bearing support structure:.” 2015. Web. 11 Dec 2019.

Vancouver:

Van Vliet E. Axisymmetrical topology optimization of an FPSO main bearing support structure:. [Internet] [Masters thesis]. Delft University of Technology; 2015. [cited 2019 Dec 11]. Available from: http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561.

Council of Science Editors:

Van Vliet E. Axisymmetrical topology optimization of an FPSO main bearing support structure:. [Masters Thesis]. Delft University of Technology; 2015. Available from: http://resolver.tudelft.nl/uuid:3243480a-1845-4ea0-bdc9-6f928405f561


University of Toronto

18. Cheeseman, Alison. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.

Degree: 2017, University of Toronto

High frequency surface wave radar (HFSWR), used for coastal surveillance, operates in a challenging environment as the clutter signals returned from the ocean surface can… (more)

Subjects/Keywords: alternating projections; CFAR; radar; sea clutter; spectral coexistence; successive convex approximation; 0544

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Cheeseman, A. (2017). Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. (Masters Thesis). University of Toronto. Retrieved from http://hdl.handle.net/1807/79106

Chicago Manual of Style (16th Edition):

Cheeseman, Alison. “Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.” 2017. Masters Thesis, University of Toronto. Accessed December 11, 2019. http://hdl.handle.net/1807/79106.

MLA Handbook (7th Edition):

Cheeseman, Alison. “Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar.” 2017. Web. 11 Dec 2019.

Vancouver:

Cheeseman A. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. [Internet] [Masters thesis]. University of Toronto; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/1807/79106.

Council of Science Editors:

Cheeseman A. Adaptive Waveform Design and CFAR Processing for High Frequency Surface Wave Radar. [Masters Thesis]. University of Toronto; 2017. Available from: http://hdl.handle.net/1807/79106


Kansas State University

19. Newell, Sarah. Optimizing daily fantasy sports contests through stochastic integer programming.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2017, Kansas State University

 The possibility of becoming a millionaire attracts over 200,000 daily fantasy sports (DFS) contest entries each Sunday of the NFL season. Millions of people play… (more)

Subjects/Keywords: Optimization; Stochastic integer programming; Fantasy sports

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Newell, S. (2017). Optimizing daily fantasy sports contests through stochastic integer programming. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/35393

Chicago Manual of Style (16th Edition):

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Masters Thesis, Kansas State University. Accessed December 11, 2019. http://hdl.handle.net/2097/35393.

MLA Handbook (7th Edition):

Newell, Sarah. “Optimizing daily fantasy sports contests through stochastic integer programming.” 2017. Web. 11 Dec 2019.

Vancouver:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Internet] [Masters thesis]. Kansas State University; 2017. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2097/35393.

Council of Science Editors:

Newell S. Optimizing daily fantasy sports contests through stochastic integer programming. [Masters Thesis]. Kansas State University; 2017. Available from: http://hdl.handle.net/2097/35393


University of South Africa

20. Ondo, Guy-Roger Abessolo. Mathematical methods for portfolio management .

Degree: 2009, University of South Africa

 Portfolio Management is the process of allocating an investor's wealth to in­ vestment opportunities over a given planning period. Not only should Portfolio Management be… (more)

Subjects/Keywords: Approximation schemes; Extreme value theory; Importance sampling; Nested decomposition; Portfolio management; Postoptimality analysis; Progressive hedging; Scenario aggregation; Stochastic programming; Stochastic Quasi-gradient; Value-at-risk

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ondo, G. A. (2009). Mathematical methods for portfolio management . (Masters Thesis). University of South Africa. Retrieved from http://hdl.handle.net/10500/784

Chicago Manual of Style (16th Edition):

Ondo, Guy-Roger Abessolo. “Mathematical methods for portfolio management .” 2009. Masters Thesis, University of South Africa. Accessed December 11, 2019. http://hdl.handle.net/10500/784.

MLA Handbook (7th Edition):

Ondo, Guy-Roger Abessolo. “Mathematical methods for portfolio management .” 2009. Web. 11 Dec 2019.

Vancouver:

Ondo GA. Mathematical methods for portfolio management . [Internet] [Masters thesis]. University of South Africa; 2009. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10500/784.

Council of Science Editors:

Ondo GA. Mathematical methods for portfolio management . [Masters Thesis]. University of South Africa; 2009. Available from: http://hdl.handle.net/10500/784


California State University – Sacramento

21. Banur Shashidhara, Divya. Using PSO algorithm for training neural networks.

Degree: MS, Computer Science, 2016, California State University – Sacramento

 Artificial Neural Networks (ANN) have a wide range of applications in the field of science & technology. An attempt was made previously in a research… (more)

Subjects/Keywords: Artificial neural networks; CUDA programming; PSO algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Banur Shashidhara, D. (2016). Using PSO algorithm for training neural networks. (Masters Thesis). California State University – Sacramento. Retrieved from http://hdl.handle.net/10211.3/171319

Chicago Manual of Style (16th Edition):

Banur Shashidhara, Divya. “Using PSO algorithm for training neural networks.” 2016. Masters Thesis, California State University – Sacramento. Accessed December 11, 2019. http://hdl.handle.net/10211.3/171319.

MLA Handbook (7th Edition):

Banur Shashidhara, Divya. “Using PSO algorithm for training neural networks.” 2016. Web. 11 Dec 2019.

Vancouver:

Banur Shashidhara D. Using PSO algorithm for training neural networks. [Internet] [Masters thesis]. California State University – Sacramento; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10211.3/171319.

Council of Science Editors:

Banur Shashidhara D. Using PSO algorithm for training neural networks. [Masters Thesis]. California State University – Sacramento; 2016. Available from: http://hdl.handle.net/10211.3/171319


University of Florida

22. Zhou, Zhiqiang. Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming.

Degree: MS, Industrial and Systems Engineering, 2014, University of Florida

 The main goal of this paper is to develop a new stochastic subgradient method for constrained stochastic convex optimization problems. The problem we are interested… (more)

Subjects/Keywords: Approximation; Entropy; Estimated cost to complete; Keywords; optimization  – rubust  – stochastic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhou, Z. (2014). Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming. (Masters Thesis). University of Florida. Retrieved from http://ufdc.ufl.edu/UFE0047301

Chicago Manual of Style (16th Edition):

Zhou, Zhiqiang. “Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming.” 2014. Masters Thesis, University of Florida. Accessed December 11, 2019. http://ufdc.ufl.edu/UFE0047301.

MLA Handbook (7th Edition):

Zhou, Zhiqiang. “Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming.” 2014. Web. 11 Dec 2019.

Vancouver:

Zhou Z. Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming. [Internet] [Masters thesis]. University of Florida; 2014. [cited 2019 Dec 11]. Available from: http://ufdc.ufl.edu/UFE0047301.

Council of Science Editors:

Zhou Z. Optimal Stochastic Subgradient Methods for Expected-Value Constrained Stochastic Programming. [Masters Thesis]. University of Florida; 2014. Available from: http://ufdc.ufl.edu/UFE0047301


University of Alberta

23. Martin, Christopher S. Approximation Algorithms for Group Coverage and Vehicle Routing Problems.

Degree: MS, Department of Computing Science, 2016, University of Alberta

 In this thesis, we present approximation algorithms for various NP-hard vehicle routing problems, as well as for a related maximum group coverage problem. Our main… (more)

Subjects/Keywords: Approximation; Algorithm; Vehicle; Routing; Group; Coverage; Problem; Deadline; Orienteering; Capacitated; Latency

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Martin, C. S. (2016). Approximation Algorithms for Group Coverage and Vehicle Routing Problems. (Masters Thesis). University of Alberta. Retrieved from https://era.library.ualberta.ca/files/cbr86b386b

Chicago Manual of Style (16th Edition):

Martin, Christopher S. “Approximation Algorithms for Group Coverage and Vehicle Routing Problems.” 2016. Masters Thesis, University of Alberta. Accessed December 11, 2019. https://era.library.ualberta.ca/files/cbr86b386b.

MLA Handbook (7th Edition):

Martin, Christopher S. “Approximation Algorithms for Group Coverage and Vehicle Routing Problems.” 2016. Web. 11 Dec 2019.

Vancouver:

Martin CS. Approximation Algorithms for Group Coverage and Vehicle Routing Problems. [Internet] [Masters thesis]. University of Alberta; 2016. [cited 2019 Dec 11]. Available from: https://era.library.ualberta.ca/files/cbr86b386b.

Council of Science Editors:

Martin CS. Approximation Algorithms for Group Coverage and Vehicle Routing Problems. [Masters Thesis]. University of Alberta; 2016. Available from: https://era.library.ualberta.ca/files/cbr86b386b


University of Cincinnati

24. Anderson, Thomas. Built-In Self Training of Hardware-Based Neural Networks.

Degree: MS, Engineering and Applied Science: Computer Engineering, 2017, University of Cincinnati

 Articial neural networks and deep learning are a topic of increasing interest in computing. This has spurred investigation into dedicated hardware like accelerators to speed… (more)

Subjects/Keywords: Computer Engineering; neural networks; backpropagation algorithm; training; accelerator; hardware; function approximation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Anderson, T. (2017). Built-In Self Training of Hardware-Based Neural Networks. (Masters Thesis). University of Cincinnati. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393

Chicago Manual of Style (16th Edition):

Anderson, Thomas. “Built-In Self Training of Hardware-Based Neural Networks.” 2017. Masters Thesis, University of Cincinnati. Accessed December 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393.

MLA Handbook (7th Edition):

Anderson, Thomas. “Built-In Self Training of Hardware-Based Neural Networks.” 2017. Web. 11 Dec 2019.

Vancouver:

Anderson T. Built-In Self Training of Hardware-Based Neural Networks. [Internet] [Masters thesis]. University of Cincinnati; 2017. [cited 2019 Dec 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393.

Council of Science Editors:

Anderson T. Built-In Self Training of Hardware-Based Neural Networks. [Masters Thesis]. University of Cincinnati; 2017. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=ucin1512039036199393


University of Minnesota

25. CHEN, TIANYI. Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches.

Degree: MS, Electrical/Computer Engineering, 2016, University of Minnesota

 Major improvements have propelled the development of worldwide Internet systems during the past decade. To meet the growing demand in massive data processing, a large… (more)

Subjects/Keywords: Convex optimization; Data centers; Machine learning; Network resource allocation; Smart grids; Stochastic optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

CHEN, T. (2016). Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches. (Masters Thesis). University of Minnesota. Retrieved from http://hdl.handle.net/11299/191192

Chicago Manual of Style (16th Edition):

CHEN, TIANYI. “Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches.” 2016. Masters Thesis, University of Minnesota. Accessed December 11, 2019. http://hdl.handle.net/11299/191192.

MLA Handbook (7th Edition):

CHEN, TIANYI. “Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches.” 2016. Web. 11 Dec 2019.

Vancouver:

CHEN T. Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches. [Internet] [Masters thesis]. University of Minnesota; 2016. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/11299/191192.

Council of Science Editors:

CHEN T. Resource Allocation for Green Cloud Networks under Uncertainty: Stochastic, Robust and Big Data-driven Approaches. [Masters Thesis]. University of Minnesota; 2016. Available from: http://hdl.handle.net/11299/191192


The Ohio State University

26. Goel, Saumya. Dynamic Probabilistic Lot-Sizing with Service Level Constraints.

Degree: MS, Industrial and Systems Engineering, 2011, The Ohio State University

 We consider inventory control problems with stochastic demand in which a specific service level must be met. We assume that demand and cost distributions over… (more)

Subjects/Keywords: Industrial Engineering; Operations Research; Stochastic programming; mixed integer programming; large scale programming; production planning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Goel, S. (2011). Dynamic Probabilistic Lot-Sizing with Service Level Constraints. (Masters Thesis). The Ohio State University. Retrieved from http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399

Chicago Manual of Style (16th Edition):

Goel, Saumya. “Dynamic Probabilistic Lot-Sizing with Service Level Constraints.” 2011. Masters Thesis, The Ohio State University. Accessed December 11, 2019. http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399.

MLA Handbook (7th Edition):

Goel, Saumya. “Dynamic Probabilistic Lot-Sizing with Service Level Constraints.” 2011. Web. 11 Dec 2019.

Vancouver:

Goel S. Dynamic Probabilistic Lot-Sizing with Service Level Constraints. [Internet] [Masters thesis]. The Ohio State University; 2011. [cited 2019 Dec 11]. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399.

Council of Science Editors:

Goel S. Dynamic Probabilistic Lot-Sizing with Service Level Constraints. [Masters Thesis]. The Ohio State University; 2011. Available from: http://rave.ohiolink.edu/etdc/view?acc_num=osu1306865399


Universiteit Utrecht

27. Jagtenberg, C.J. On Machine Scheduling with Exponentially Distributed Processing Times.

Degree: 2011, Universiteit Utrecht

 We address the problem to minimize the weighted sum of completion times in nonpreemptive parallel machine scheduling. We consider the stochastic variant of this problem… (more)

Subjects/Keywords: stochastic scheduling; WSEPT; exponential distribution; deliberate idleness; computational complexity

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jagtenberg, C. J. (2011). On Machine Scheduling with Exponentially Distributed Processing Times. (Masters Thesis). Universiteit Utrecht. Retrieved from http://dspace.library.uu.nl:8080/handle/1874/212927

Chicago Manual of Style (16th Edition):

Jagtenberg, C J. “On Machine Scheduling with Exponentially Distributed Processing Times.” 2011. Masters Thesis, Universiteit Utrecht. Accessed December 11, 2019. http://dspace.library.uu.nl:8080/handle/1874/212927.

MLA Handbook (7th Edition):

Jagtenberg, C J. “On Machine Scheduling with Exponentially Distributed Processing Times.” 2011. Web. 11 Dec 2019.

Vancouver:

Jagtenberg CJ. On Machine Scheduling with Exponentially Distributed Processing Times. [Internet] [Masters thesis]. Universiteit Utrecht; 2011. [cited 2019 Dec 11]. Available from: http://dspace.library.uu.nl:8080/handle/1874/212927.

Council of Science Editors:

Jagtenberg CJ. On Machine Scheduling with Exponentially Distributed Processing Times. [Masters Thesis]. Universiteit Utrecht; 2011. Available from: http://dspace.library.uu.nl:8080/handle/1874/212927


Virginia Tech

28. Travis, Elli. The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador.

Degree: MS, Agricultural and Applied Economics, 2015, Virginia Tech

 Adoption of new agricultural technologies by farmers in developing countries is sometimes limited, despite the associated benefits. Potato farmers in Carchi, Ecuador rely heavily on… (more)

Subjects/Keywords: uncertainty; dynamic programming; agricultural extension; randomized control trial; integrated pest management; Adoption

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Travis, E. (2015). The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/78155

Chicago Manual of Style (16th Edition):

Travis, Elli. “The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador.” 2015. Masters Thesis, Virginia Tech. Accessed December 11, 2019. http://hdl.handle.net/10919/78155.

MLA Handbook (7th Edition):

Travis, Elli. “The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador.” 2015. Web. 11 Dec 2019.

Vancouver:

Travis E. The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador. [Internet] [Masters thesis]. Virginia Tech; 2015. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10919/78155.

Council of Science Editors:

Travis E. The Impact of Text Messages on Adoption and Knowledge of Integrated Pest Management Practices: A Randomized Control Trial Study of Potato Farmers in Carchi, Ecuador. [Masters Thesis]. Virginia Tech; 2015. Available from: http://hdl.handle.net/10919/78155


Kansas State University

29. Choubey, Anand M. Platform based approach for economic production of a product family.

Degree: MS, Department of Industrial & Manufacturing Systems Engineering, 2007, Kansas State University

 In present competitive market, there is growing concern for ascertaining and fulfilling the individual customer’s wants and needs. Therefore, the focus of manufacturing has been… (more)

Subjects/Keywords: Mass Customization; Production Planning; Product Platforms; Stochastic Programming; Genetic Algorithm; Engineering, Industrial (0546); Operations Research (0796)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Choubey, A. M. (2007). Platform based approach for economic production of a product family. (Masters Thesis). Kansas State University. Retrieved from http://hdl.handle.net/2097/434

Chicago Manual of Style (16th Edition):

Choubey, Anand M. “Platform based approach for economic production of a product family.” 2007. Masters Thesis, Kansas State University. Accessed December 11, 2019. http://hdl.handle.net/2097/434.

MLA Handbook (7th Edition):

Choubey, Anand M. “Platform based approach for economic production of a product family.” 2007. Web. 11 Dec 2019.

Vancouver:

Choubey AM. Platform based approach for economic production of a product family. [Internet] [Masters thesis]. Kansas State University; 2007. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/2097/434.

Council of Science Editors:

Choubey AM. Platform based approach for economic production of a product family. [Masters Thesis]. Kansas State University; 2007. Available from: http://hdl.handle.net/2097/434


Virginia Tech

30. Singh, Manish K. Optimal Operation of Water and Power Distribution Networks.

Degree: MS, Electrical and Computer Engineering, 2018, Virginia Tech

 The advent of smart cities has promoted research towards interdependent operation of utilities such as water and power systems. While power system analysis is significantly… (more)

Subjects/Keywords: Optimal water flow; distribution system restoration; convex relaxation; mixed-integer programming; optimal islanding

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Singh, M. K. (2018). Optimal Operation of Water and Power Distribution Networks. (Masters Thesis). Virginia Tech. Retrieved from http://hdl.handle.net/10919/86860

Chicago Manual of Style (16th Edition):

Singh, Manish K. “Optimal Operation of Water and Power Distribution Networks.” 2018. Masters Thesis, Virginia Tech. Accessed December 11, 2019. http://hdl.handle.net/10919/86860.

MLA Handbook (7th Edition):

Singh, Manish K. “Optimal Operation of Water and Power Distribution Networks.” 2018. Web. 11 Dec 2019.

Vancouver:

Singh MK. Optimal Operation of Water and Power Distribution Networks. [Internet] [Masters thesis]. Virginia Tech; 2018. [cited 2019 Dec 11]. Available from: http://hdl.handle.net/10919/86860.

Council of Science Editors:

Singh MK. Optimal Operation of Water and Power Distribution Networks. [Masters Thesis]. Virginia Tech; 2018. Available from: http://hdl.handle.net/10919/86860

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

.