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

You searched for subject:(stochastic programming). Showing records 1 – 30 of 691 total matches.

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

Search Limiters

Last 2 Years | English Only

Degrees

Levels

Languages

Country

▼ Search Limiters


Princeton University

1. Perkins, Raymond Theodore. Multistage Stochastic Programming with Parametric Cost Function Approximations .

Degree: PhD, 2018, Princeton University

 A widely used heuristic for solving stochastic optimization problems is to use a deterministic rolling horizon procedure which has been modified to handle uncertainty (e.g.… (more)

Subjects/Keywords: Cost Function Approximations; Stochastic Optimization; Stochastic Programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Perkins, R. T. (2018). Multistage Stochastic Programming with Parametric Cost Function Approximations . (Doctoral Dissertation). Princeton University. Retrieved from http://arks.princeton.edu/ark:/88435/dsp018c97kt118

Chicago Manual of Style (16th Edition):

Perkins, Raymond Theodore. “Multistage Stochastic Programming with Parametric Cost Function Approximations .” 2018. Doctoral Dissertation, Princeton University. Accessed April 17, 2021. http://arks.princeton.edu/ark:/88435/dsp018c97kt118.

MLA Handbook (7th Edition):

Perkins, Raymond Theodore. “Multistage Stochastic Programming with Parametric Cost Function Approximations .” 2018. Web. 17 Apr 2021.

Vancouver:

Perkins RT. Multistage Stochastic Programming with Parametric Cost Function Approximations . [Internet] [Doctoral dissertation]. Princeton University; 2018. [cited 2021 Apr 17]. Available from: http://arks.princeton.edu/ark:/88435/dsp018c97kt118.

Council of Science Editors:

Perkins RT. Multistage Stochastic Programming with Parametric Cost Function Approximations . [Doctoral Dissertation]. Princeton University; 2018. Available from: http://arks.princeton.edu/ark:/88435/dsp018c97kt118


University of New South Wales

2. Wu, Wei. Limitations of dynamic programming approach: singularity and time inconsistency.

Degree: Mathematics & Statistics, 2016, University of New South Wales

 Two failures of the dynamic programming (DP) approach to the stochastic optimal control problem are investigated. The first failure arises when we wish to solve… (more)

Subjects/Keywords: Stochastic optimal control; Dynamic programming; Stochastic control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Wu, W. (2016). Limitations of dynamic programming approach: singularity and time inconsistency. (Doctoral Dissertation). University of New South Wales. Retrieved from http://handle.unsw.edu.au/1959.4/56208 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40264/SOURCE02?view=true

Chicago Manual of Style (16th Edition):

Wu, Wei. “Limitations of dynamic programming approach: singularity and time inconsistency.” 2016. Doctoral Dissertation, University of New South Wales. Accessed April 17, 2021. http://handle.unsw.edu.au/1959.4/56208 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40264/SOURCE02?view=true.

MLA Handbook (7th Edition):

Wu, Wei. “Limitations of dynamic programming approach: singularity and time inconsistency.” 2016. Web. 17 Apr 2021.

Vancouver:

Wu W. Limitations of dynamic programming approach: singularity and time inconsistency. [Internet] [Doctoral dissertation]. University of New South Wales; 2016. [cited 2021 Apr 17]. Available from: http://handle.unsw.edu.au/1959.4/56208 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40264/SOURCE02?view=true.

Council of Science Editors:

Wu W. Limitations of dynamic programming approach: singularity and time inconsistency. [Doctoral Dissertation]. University of New South Wales; 2016. Available from: http://handle.unsw.edu.au/1959.4/56208 ; https://unsworks.unsw.edu.au/fapi/datastream/unsworks:40264/SOURCE02?view=true


Dalhousie University

3. Comeau, Jules. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.

Degree: PhD, Department of Industrial Engineering, 2011, Dalhousie University

 The main goal is to develop decision policies for individual forest stand management. It addresses three major areas of interest in the optimal management of… (more)

Subjects/Keywords: Dynamic Programming; Forestry; Stochastic

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Comeau, J. (2011). A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. (Doctoral Dissertation). Dalhousie University. Retrieved from http://hdl.handle.net/10222/13309

Chicago Manual of Style (16th Edition):

Comeau, Jules. “A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.” 2011. Doctoral Dissertation, Dalhousie University. Accessed April 17, 2021. http://hdl.handle.net/10222/13309.

MLA Handbook (7th Edition):

Comeau, Jules. “A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES.” 2011. Web. 17 Apr 2021.

Vancouver:

Comeau J. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. [Internet] [Doctoral dissertation]. Dalhousie University; 2011. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10222/13309.

Council of Science Editors:

Comeau J. A STOCHASTIC DYNAMIC PROGRAMMING APPROACH FOR OPTIMIZING MIXED-SPECIES FOREST STAND MANAGEMENT POLICIES. [Doctoral Dissertation]. Dalhousie University; 2011. Available from: http://hdl.handle.net/10222/13309


Texas A&M University

4. Kabli, Mohannad Reda A. Stochastic Programming Model for Fuel Treatment Management.

Degree: MS, Industrial and Systems Engineering, 2014, Texas A&M University

 Due to the increased number and intensity of wild fires, the need for solutions that minimize the impact of fire are needed. Fuel treatment is… (more)

Subjects/Keywords: fuel treatment; optimization; stochastic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kabli, M. R. A. (2014). Stochastic Programming Model for Fuel Treatment Management. (Masters Thesis). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/152840

Chicago Manual of Style (16th Edition):

Kabli, Mohannad Reda A. “Stochastic Programming Model for Fuel Treatment Management.” 2014. Masters Thesis, Texas A&M University. Accessed April 17, 2021. http://hdl.handle.net/1969.1/152840.

MLA Handbook (7th Edition):

Kabli, Mohannad Reda A. “Stochastic Programming Model for Fuel Treatment Management.” 2014. Web. 17 Apr 2021.

Vancouver:

Kabli MRA. Stochastic Programming Model for Fuel Treatment Management. [Internet] [Masters thesis]. Texas A&M University; 2014. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1969.1/152840.

Council of Science Editors:

Kabli MRA. Stochastic Programming Model for Fuel Treatment Management. [Masters Thesis]. Texas A&M University; 2014. Available from: http://hdl.handle.net/1969.1/152840


University of Southern California

5. Chen, Kai. Variants of stochastic knapsack problems.

Degree: PhD, Industrial and Systems Engineering, 2013, University of Southern California

 We consider variants of stochastic knapsack problems with different problem settings, on-line vs off-line, and with different assumptions on the objective functions. We try to… (more)

Subjects/Keywords: stochastic; knapsack; dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Chen, K. (2013). Variants of stochastic knapsack problems. (Doctoral Dissertation). University of Southern California. Retrieved from http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812

Chicago Manual of Style (16th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Doctoral Dissertation, University of Southern California. Accessed April 17, 2021. http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812.

MLA Handbook (7th Edition):

Chen, Kai. “Variants of stochastic knapsack problems.” 2013. Web. 17 Apr 2021.

Vancouver:

Chen K. Variants of stochastic knapsack problems. [Internet] [Doctoral dissertation]. University of Southern California; 2013. [cited 2021 Apr 17]. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812.

Council of Science Editors:

Chen K. Variants of stochastic knapsack problems. [Doctoral Dissertation]. University of Southern California; 2013. Available from: http://digitallibrary.usc.edu/cdm/compoundobject/collection/p15799coll3/id/347957/rec/7812


University of Waterloo

6. 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 April 17, 2021. 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. 17 Apr 2021.

Vancouver:

Shateri M. Task Optimization and Workforce Scheduling. [Internet] [Thesis]. University of Waterloo; 2011. [cited 2021 Apr 17]. 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


Delft University of Technology

7. van Rooijen, Dennis (author). Spread-based Stochastic High Frequency Railway Optimization.

Degree: 2020, Delft University of Technology

 This paper outlines a mathematical model for the creation of a robust timetable for the optimization of the lightrail network in Rotterdam and The Hague.… (more)

Subjects/Keywords: Stochastic; Programming; Statistics; Trains; Timetable

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

van Rooijen, D. (. (2020). Spread-based Stochastic High Frequency Railway Optimization. (Masters Thesis). Delft University of Technology. Retrieved from http://resolver.tudelft.nl/uuid:3847c655-dc47-4a83-b1f3-cb2f5eafdd7c

Chicago Manual of Style (16th Edition):

van Rooijen, Dennis (author). “Spread-based Stochastic High Frequency Railway Optimization.” 2020. Masters Thesis, Delft University of Technology. Accessed April 17, 2021. http://resolver.tudelft.nl/uuid:3847c655-dc47-4a83-b1f3-cb2f5eafdd7c.

MLA Handbook (7th Edition):

van Rooijen, Dennis (author). “Spread-based Stochastic High Frequency Railway Optimization.” 2020. Web. 17 Apr 2021.

Vancouver:

van Rooijen D(. Spread-based Stochastic High Frequency Railway Optimization. [Internet] [Masters thesis]. Delft University of Technology; 2020. [cited 2021 Apr 17]. Available from: http://resolver.tudelft.nl/uuid:3847c655-dc47-4a83-b1f3-cb2f5eafdd7c.

Council of Science Editors:

van Rooijen D(. Spread-based Stochastic High Frequency Railway Optimization. [Masters Thesis]. Delft University of Technology; 2020. Available from: http://resolver.tudelft.nl/uuid:3847c655-dc47-4a83-b1f3-cb2f5eafdd7c


University of Texas – Austin

8. Fayvisovich, Roman. Martingale-generated control structures and a framework for the dynamic programming principle.

Degree: PhD, Mathematics, 2017, University of Texas – Austin

 This thesis constructs an abstract framework in which the dynamic programming principle (DPP) can be proven for a broad range of stochastic control problems. Using… (more)

Subjects/Keywords: Stochastic control; Dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Fayvisovich, R. (2017). Martingale-generated control structures and a framework for the dynamic programming principle. (Doctoral Dissertation). University of Texas – Austin. Retrieved from http://hdl.handle.net/2152/62105

Chicago Manual of Style (16th Edition):

Fayvisovich, Roman. “Martingale-generated control structures and a framework for the dynamic programming principle.” 2017. Doctoral Dissertation, University of Texas – Austin. Accessed April 17, 2021. http://hdl.handle.net/2152/62105.

MLA Handbook (7th Edition):

Fayvisovich, Roman. “Martingale-generated control structures and a framework for the dynamic programming principle.” 2017. Web. 17 Apr 2021.

Vancouver:

Fayvisovich R. Martingale-generated control structures and a framework for the dynamic programming principle. [Internet] [Doctoral dissertation]. University of Texas – Austin; 2017. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2152/62105.

Council of Science Editors:

Fayvisovich R. Martingale-generated control structures and a framework for the dynamic programming principle. [Doctoral Dissertation]. University of Texas – Austin; 2017. Available from: http://hdl.handle.net/2152/62105


Rutgers University

9. 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 April 17, 2021. 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. 17 Apr 2021.

Vancouver:

Xu C. Simulation approach to two-stage bond portfolio optimization problem. [Internet] [Masters thesis]. Rutgers University; 2014. [cited 2021 Apr 17]. 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/


San Jose State University

10. 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 April 17, 2021. 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. 17 Apr 2021.

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 2021 Apr 17]. 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

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 April 17, 2021. 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. 17 Apr 2021.

Vancouver:

Britt JW. Stochastic Goal Programming and a Metaheuristic for Scheduling of Operating Rooms. [Internet] [Masters thesis]. University of Windsor; 2015. [cited 2021 Apr 17]. 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


University of Sydney

12. Jiao, Chunxi. Semidefinite relaxations for a linear programming approach to exit-time stochastic control .

Degree: 2021, University of Sydney

 In this thesis, we investigate the linear programming framework for exit-time stochastic control problems and apply the moment-sum-of-squares (moment-SOS) hierarchy to obtain convergent pointwise bounds… (more)

Subjects/Keywords: stochastic control; linear programming; semidefinite programming; duality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jiao, C. (2021). Semidefinite relaxations for a linear programming approach to exit-time stochastic control . (Thesis). University of Sydney. Retrieved from http://hdl.handle.net/2123/24569

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):

Jiao, Chunxi. “Semidefinite relaxations for a linear programming approach to exit-time stochastic control .” 2021. Thesis, University of Sydney. Accessed April 17, 2021. http://hdl.handle.net/2123/24569.

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

MLA Handbook (7th Edition):

Jiao, Chunxi. “Semidefinite relaxations for a linear programming approach to exit-time stochastic control .” 2021. Web. 17 Apr 2021.

Vancouver:

Jiao C. Semidefinite relaxations for a linear programming approach to exit-time stochastic control . [Internet] [Thesis]. University of Sydney; 2021. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2123/24569.

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

Council of Science Editors:

Jiao C. Semidefinite relaxations for a linear programming approach to exit-time stochastic control . [Thesis]. University of Sydney; 2021. Available from: http://hdl.handle.net/2123/24569

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


University College Cork

13. Visentin, Andrea. Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches.

Degree: 2020, University College Cork

 The objective of this work is to introduce techniques for the computation of optimal and near-optimal inventory control policy parameters for the stochastic inventory control… (more)

Subjects/Keywords: Inventory control; Dynamic programming; Stochastic programming; Stochastic lot sizing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Visentin, A. (2020). Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches. (Thesis). University College Cork. Retrieved from http://hdl.handle.net/10468/10601

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):

Visentin, Andrea. “Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches.” 2020. Thesis, University College Cork. Accessed April 17, 2021. http://hdl.handle.net/10468/10601.

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

MLA Handbook (7th Edition):

Visentin, Andrea. “Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches.” 2020. Web. 17 Apr 2021.

Vancouver:

Visentin A. Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches. [Internet] [Thesis]. University College Cork; 2020. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10468/10601.

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

Council of Science Editors:

Visentin A. Computing policy parameters for stochastic inventory control using stochastic dynamic programming approaches. [Thesis]. University College Cork; 2020. Available from: http://hdl.handle.net/10468/10601

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


Western Kentucky University

14. 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 April 17, 2021. 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. 17 Apr 2021.

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 2021 Apr 17]. 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


Georgia Tech

15. Angulo Olivares, Gustavo, I. Integer programming approaches for semicontinuous and stochastic optimization.

Degree: PhD, Industrial and Systems Engineering, 2014, Georgia Tech

 This thesis concerns the application of mixed-integer programming techniques to solve special classes of network flow problems and stochastic integer programs. We draw tools from… (more)

Subjects/Keywords: Integer programming; Stochastic programming; Forbidden vertices; Mathematical optimization; Dynamic programming; Integer programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Angulo Olivares, Gustavo, I. (2014). Integer programming approaches for semicontinuous and stochastic optimization. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/51862

Chicago Manual of Style (16th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Doctoral Dissertation, Georgia Tech. Accessed April 17, 2021. http://hdl.handle.net/1853/51862.

MLA Handbook (7th Edition):

Angulo Olivares, Gustavo, I. “Integer programming approaches for semicontinuous and stochastic optimization.” 2014. Web. 17 Apr 2021.

Vancouver:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Internet] [Doctoral dissertation]. Georgia Tech; 2014. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1853/51862.

Council of Science Editors:

Angulo Olivares, Gustavo I. Integer programming approaches for semicontinuous and stochastic optimization. [Doctoral Dissertation]. Georgia Tech; 2014. Available from: http://hdl.handle.net/1853/51862

16. Lamontagne, Jonathan. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization.

Degree: PhD, Civil and Environmental Engineering, 2015, Cornell University

 This thesis focuses on optimization techniques for multi-reservoir hydropower systems operation, with a particular concern with the representation and impact of uncertainty. The thesis reports… (more)

Subjects/Keywords: Dynamic Programming; Stochastic Optimization; Uncertainty Analysis

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Lamontagne, J. (2015). Representation Of Uncertainty And Corridor Dp For Hydropower Optimization. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/39482

Chicago Manual of Style (16th Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization.” 2015. Doctoral Dissertation, Cornell University. Accessed April 17, 2021. http://hdl.handle.net/1813/39482.

MLA Handbook (7th Edition):

Lamontagne, Jonathan. “Representation Of Uncertainty And Corridor Dp For Hydropower Optimization.” 2015. Web. 17 Apr 2021.

Vancouver:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1813/39482.

Council of Science Editors:

Lamontagne J. Representation Of Uncertainty And Corridor Dp For Hydropower Optimization. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/39482


Texas A&M University

17. Zhang, Liqing. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.

Degree: PhD, Industrial Engineering, 2011, Texas A&M University

 Recent supply chain literature and practice recognize that significant cost savings can be achieved by coordinating inventory and transportation decisions. Although the existing literature on… (more)

Subjects/Keywords: Stochastic dynamic programming; Shipment consolidation; Inventory/production

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zhang, L. (2011). Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. (Doctoral Dissertation). Texas A&M University. Retrieved from http://hdl.handle.net/1969.1/150943

Chicago Manual of Style (16th Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Doctoral Dissertation, Texas A&M University. Accessed April 17, 2021. http://hdl.handle.net/1969.1/150943.

MLA Handbook (7th Edition):

Zhang, Liqing. “Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions.” 2011. Web. 17 Apr 2021.

Vancouver:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Internet] [Doctoral dissertation]. Texas A&M University; 2011. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1969.1/150943.

Council of Science Editors:

Zhang L. Stochastic Dynamic Demand Inventory Models with Explicit Transportation Costs and Decisions. [Doctoral Dissertation]. Texas A&M University; 2011. Available from: http://hdl.handle.net/1969.1/150943

18. Hult, Edward Eric. Stochastic hub and spoke networks.

Degree: PhD, 2011, University of Cambridge

 Transportation systems such as mail, freight, passenger and even telecommunication systems most often employ a hub and spoke network structure since correctly designed they give… (more)

Subjects/Keywords: Stochastic programming; Hub and spoke networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hult, E. E. (2011). Stochastic hub and spoke networks. (Doctoral Dissertation). University of Cambridge. Retrieved from http://www.dspace.cam.ac.uk/handle/1810/240611https://www.repository.cam.ac.uk/bitstream/1810/240611/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/3/license_url ; https://www.repository.cam.ac.uk/bitstream/1810/240611/4/license_text ; https://www.repository.cam.ac.uk/bitstream/1810/240611/5/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/240611/8/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/9/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.jpg

Chicago Manual of Style (16th Edition):

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Doctoral Dissertation, University of Cambridge. Accessed April 17, 2021. http://www.dspace.cam.ac.uk/handle/1810/240611https://www.repository.cam.ac.uk/bitstream/1810/240611/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/3/license_url ; https://www.repository.cam.ac.uk/bitstream/1810/240611/4/license_text ; https://www.repository.cam.ac.uk/bitstream/1810/240611/5/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/240611/8/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/9/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.jpg.

MLA Handbook (7th Edition):

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Web. 17 Apr 2021.

Vancouver:

Hult EE. Stochastic hub and spoke networks. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2021 Apr 17]. Available from: http://www.dspace.cam.ac.uk/handle/1810/240611https://www.repository.cam.ac.uk/bitstream/1810/240611/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/3/license_url ; https://www.repository.cam.ac.uk/bitstream/1810/240611/4/license_text ; https://www.repository.cam.ac.uk/bitstream/1810/240611/5/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/240611/8/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/9/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.jpg.

Council of Science Editors:

Hult EE. Stochastic hub and spoke networks. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: http://www.dspace.cam.ac.uk/handle/1810/240611https://www.repository.cam.ac.uk/bitstream/1810/240611/2/license.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/3/license_url ; https://www.repository.cam.ac.uk/bitstream/1810/240611/4/license_text ; https://www.repository.cam.ac.uk/bitstream/1810/240611/5/license_rdf ; https://www.repository.cam.ac.uk/bitstream/1810/240611/8/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.txt ; https://www.repository.cam.ac.uk/bitstream/1810/240611/9/PhD%20Thesis%2c%20E%20Hult%20Final.pdf.jpg


Université Catholique de Louvain

19. Saint-Guillain, Michael. Models and algorithms for online stochastic vehicle routing problems.

Degree: 2019, Université Catholique de Louvain

What will be tomorrow's big cities objectives and challenges? Most of the operational problems from the real world are inherently subject to uncertainty, requiring the… (more)

Subjects/Keywords: Stochastic programming; Online; Dynamic; Vehicle routing

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Saint-Guillain, M. (2019). Models and algorithms for online stochastic vehicle routing problems. (Thesis). Université Catholique de Louvain. Retrieved from http://hdl.handle.net/2078.1/222571

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):

Saint-Guillain, Michael. “Models and algorithms for online stochastic vehicle routing problems.” 2019. Thesis, Université Catholique de Louvain. Accessed April 17, 2021. http://hdl.handle.net/2078.1/222571.

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

MLA Handbook (7th Edition):

Saint-Guillain, Michael. “Models and algorithms for online stochastic vehicle routing problems.” 2019. Web. 17 Apr 2021.

Vancouver:

Saint-Guillain M. Models and algorithms for online stochastic vehicle routing problems. [Internet] [Thesis]. Université Catholique de Louvain; 2019. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/2078.1/222571.

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

Council of Science Editors:

Saint-Guillain M. Models and algorithms for online stochastic vehicle routing problems. [Thesis]. Université Catholique de Louvain; 2019. Available from: http://hdl.handle.net/2078.1/222571

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


University of Edinburgh

20. Yang, Xinan. Top-percentile traffic routing problem.

Degree: PhD, 2012, University of Edinburgh

 Multi-homing is a technology used by Internet Service Provider (ISP) to connect to the Internet via multiple networks. This connectivity enhances the network reliability and… (more)

Subjects/Keywords: 621.382; top-percentile; stochastic; approximate dynamic programming

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Yang, X. (2012). Top-percentile traffic routing problem. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/5883

Chicago Manual of Style (16th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Doctoral Dissertation, University of Edinburgh. Accessed April 17, 2021. http://hdl.handle.net/1842/5883.

MLA Handbook (7th Edition):

Yang, Xinan. “Top-percentile traffic routing problem.” 2012. Web. 17 Apr 2021.

Vancouver:

Yang X. Top-percentile traffic routing problem. [Internet] [Doctoral dissertation]. University of Edinburgh; 2012. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1842/5883.

Council of Science Editors:

Yang X. Top-percentile traffic routing problem. [Doctoral Dissertation]. University of Edinburgh; 2012. Available from: http://hdl.handle.net/1842/5883


University of Waterloo

21. Gunter, Joshua. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands.

Degree: 2020, University of Waterloo

 The capacitated vehicle routing problem with stochastic demands (CVRPSD) is a variant of the deterministic capacitated vehicle routing problem (CVRP). The CVRP consists of planning… (more)

Subjects/Keywords: vehicle routing problem; stochastic programming; set partitioning

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Gunter, J. (2020). The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. (Thesis). University of Waterloo. Retrieved from http://hdl.handle.net/10012/16479

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):

Gunter, Joshua. “The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands.” 2020. Thesis, University of Waterloo. Accessed April 17, 2021. http://hdl.handle.net/10012/16479.

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

MLA Handbook (7th Edition):

Gunter, Joshua. “The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands.” 2020. Web. 17 Apr 2021.

Vancouver:

Gunter J. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. [Internet] [Thesis]. University of Waterloo; 2020. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/10012/16479.

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

Council of Science Editors:

Gunter J. The complexity of some set-partitioning formulations for the vehicle routing problem with stochastic demands. [Thesis]. University of Waterloo; 2020. Available from: http://hdl.handle.net/10012/16479

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


Texas State University – San Marcos

22. Joshi, Alakshendra. Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem.

Degree: MS, Engineering, 2020, Texas State University – San Marcos

 Trauma is an essential aspect that must be considered by governing bodies when providing and expanding healthcare services across their jurisdiction. This thesis focuses on… (more)

Subjects/Keywords: Trauma; Forecasting; ARIMA; Stochastic programming; Facility location

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Joshi, A. (2020). Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem. (Masters Thesis). Texas State University – San Marcos. Retrieved from https://digital.library.txstate.edu/handle/10877/12932

Chicago Manual of Style (16th Edition):

Joshi, Alakshendra. “Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem.” 2020. Masters Thesis, Texas State University – San Marcos. Accessed April 17, 2021. https://digital.library.txstate.edu/handle/10877/12932.

MLA Handbook (7th Edition):

Joshi, Alakshendra. “Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem.” 2020. Web. 17 Apr 2021.

Vancouver:

Joshi A. Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem. [Internet] [Masters thesis]. Texas State University – San Marcos; 2020. [cited 2021 Apr 17]. Available from: https://digital.library.txstate.edu/handle/10877/12932.

Council of Science Editors:

Joshi A. Forecasting and Stochastic Programming Models to Address Uncertainty in the Trauma System Configuration Problem. [Masters Thesis]. Texas State University – San Marcos; 2020. Available from: https://digital.library.txstate.edu/handle/10877/12932


Georgia Tech

23. Ye, Fan. Information relaxation in stochastic optimal control.

Degree: PhD, Industrial and Systems Engineering, 2015, Georgia Tech

 Dynamic programming is a principal method for analyzing stochastic optimal control problems. However, the exact computation of dynamic programming can be intractable in large-scale problems… (more)

Subjects/Keywords: Dynamic programming; Stochastic control; Information relaxation; Duality

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ye, F. (2015). Information relaxation in stochastic optimal control. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/55511

Chicago Manual of Style (16th Edition):

Ye, Fan. “Information relaxation in stochastic optimal control.” 2015. Doctoral Dissertation, Georgia Tech. Accessed April 17, 2021. http://hdl.handle.net/1853/55511.

MLA Handbook (7th Edition):

Ye, Fan. “Information relaxation in stochastic optimal control.” 2015. Web. 17 Apr 2021.

Vancouver:

Ye F. Information relaxation in stochastic optimal control. [Internet] [Doctoral dissertation]. Georgia Tech; 2015. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1853/55511.

Council of Science Editors:

Ye F. Information relaxation in stochastic optimal control. [Doctoral Dissertation]. Georgia Tech; 2015. Available from: http://hdl.handle.net/1853/55511


University of Edinburgh

24. Schulze, Tim. Stochastic programming for hydro-thermal unit commitment.

Degree: PhD, 2015, University of Edinburgh

 In recent years the deregulation of energy markets and expansion of volatile renewable energy supplies has triggered an increased interest in stochastic optimization models for… (more)

Subjects/Keywords: 519.6; stochastic programming; optimization; unit commitment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Schulze, T. (2015). Stochastic programming for hydro-thermal unit commitment. (Doctoral Dissertation). University of Edinburgh. Retrieved from http://hdl.handle.net/1842/15775

Chicago Manual of Style (16th Edition):

Schulze, Tim. “Stochastic programming for hydro-thermal unit commitment.” 2015. Doctoral Dissertation, University of Edinburgh. Accessed April 17, 2021. http://hdl.handle.net/1842/15775.

MLA Handbook (7th Edition):

Schulze, Tim. “Stochastic programming for hydro-thermal unit commitment.” 2015. Web. 17 Apr 2021.

Vancouver:

Schulze T. Stochastic programming for hydro-thermal unit commitment. [Internet] [Doctoral dissertation]. University of Edinburgh; 2015. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1842/15775.

Council of Science Editors:

Schulze T. Stochastic programming for hydro-thermal unit commitment. [Doctoral Dissertation]. University of Edinburgh; 2015. Available from: http://hdl.handle.net/1842/15775


University of Cambridge

25. Hult, Edward Eric. Stochastic hub and spoke networks.

Degree: PhD, 2011, University of Cambridge

 Transportation systems such as mail, freight, passenger and even telecommunication systems most often employ a hub and spoke network structure since correctly designed they give… (more)

Subjects/Keywords: 658; Stochastic programming; Hub and spoke networks

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Hult, E. E. (2011). Stochastic hub and spoke networks. (Doctoral Dissertation). University of Cambridge. Retrieved from https://doi.org/10.17863/CAM.16457 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926

Chicago Manual of Style (16th Edition):

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Doctoral Dissertation, University of Cambridge. Accessed April 17, 2021. https://doi.org/10.17863/CAM.16457 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926.

MLA Handbook (7th Edition):

Hult, Edward Eric. “Stochastic hub and spoke networks.” 2011. Web. 17 Apr 2021.

Vancouver:

Hult EE. Stochastic hub and spoke networks. [Internet] [Doctoral dissertation]. University of Cambridge; 2011. [cited 2021 Apr 17]. Available from: https://doi.org/10.17863/CAM.16457 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926.

Council of Science Editors:

Hult EE. Stochastic hub and spoke networks. [Doctoral Dissertation]. University of Cambridge; 2011. Available from: https://doi.org/10.17863/CAM.16457 ; https://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.541926


Brno University of Technology

26. Novotný, Jan. Modely stochastického programování a jejich aplikace: Stochastic programming models with applications.

Degree: 2018, Brno University of Technology

 The thesis deals with stochastic programming and its application to aggregate blending, an optimization problem within the area of civil engineering. The theoretical part is… (more)

Subjects/Keywords: stochastické programování; dvojstupňové stochastické programování; mísení kameniva; stochastic programming; two-stage stochastic programming; aggregate blending

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Novotný, J. (2018). Modely stochastického programování a jejich aplikace: Stochastic programming models with applications. (Thesis). Brno University of Technology. Retrieved from http://hdl.handle.net/11012/3315

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):

Novotný, Jan. “Modely stochastického programování a jejich aplikace: Stochastic programming models with applications.” 2018. Thesis, Brno University of Technology. Accessed April 17, 2021. http://hdl.handle.net/11012/3315.

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

MLA Handbook (7th Edition):

Novotný, Jan. “Modely stochastického programování a jejich aplikace: Stochastic programming models with applications.” 2018. Web. 17 Apr 2021.

Vancouver:

Novotný J. Modely stochastického programování a jejich aplikace: Stochastic programming models with applications. [Internet] [Thesis]. Brno University of Technology; 2018. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/11012/3315.

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

Council of Science Editors:

Novotný J. Modely stochastického programování a jejich aplikace: Stochastic programming models with applications. [Thesis]. Brno University of Technology; 2018. Available from: http://hdl.handle.net/11012/3315

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


Georgia Tech

27. Zou, Jikai. Large scale multistage stochastic integer programming with applications in electric power systems.

Degree: PhD, Industrial and Systems Engineering, 2017, Georgia Tech

 Multistage stochastic integer programming (MSIP) is a framework for sequential decision making under uncertainty, where the uncertainty is modeled by a general stochastic process, and… (more)

Subjects/Keywords: Multistage stochastic integer programming; Stochastic dual dynamic programming; Power systems; Generation expansion planning; Unit commitment

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zou, J. (2017). Large scale multistage stochastic integer programming with applications in electric power systems. (Doctoral Dissertation). Georgia Tech. Retrieved from http://hdl.handle.net/1853/59102

Chicago Manual of Style (16th Edition):

Zou, Jikai. “Large scale multistage stochastic integer programming with applications in electric power systems.” 2017. Doctoral Dissertation, Georgia Tech. Accessed April 17, 2021. http://hdl.handle.net/1853/59102.

MLA Handbook (7th Edition):

Zou, Jikai. “Large scale multistage stochastic integer programming with applications in electric power systems.” 2017. Web. 17 Apr 2021.

Vancouver:

Zou J. Large scale multistage stochastic integer programming with applications in electric power systems. [Internet] [Doctoral dissertation]. Georgia Tech; 2017. [cited 2021 Apr 17]. Available from: http://hdl.handle.net/1853/59102.

Council of Science Editors:

Zou J. Large scale multistage stochastic integer programming with applications in electric power systems. [Doctoral Dissertation]. Georgia Tech; 2017. Available from: http://hdl.handle.net/1853/59102

28. Ansari, Saiful Islam. Study of some developments in stochastic programming and their applications; -.

Degree: Statistics, 2014, Aligarh Muslim University

non

Bibliography p.71-98

Advisors/Committee Members: Mohammad, Khalid Masood.

Subjects/Keywords: Stochastic; Stochastic Programming; their Applications

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ansari, S. I. (2014). Study of some developments in stochastic programming and their applications; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/28650

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):

Ansari, Saiful Islam. “Study of some developments in stochastic programming and their applications; -.” 2014. Thesis, Aligarh Muslim University. Accessed April 17, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/28650.

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

MLA Handbook (7th Edition):

Ansari, Saiful Islam. “Study of some developments in stochastic programming and their applications; -.” 2014. Web. 17 Apr 2021.

Vancouver:

Ansari SI. Study of some developments in stochastic programming and their applications; -. [Internet] [Thesis]. Aligarh Muslim University; 2014. [cited 2021 Apr 17]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28650.

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

Council of Science Editors:

Ansari SI. Study of some developments in stochastic programming and their applications; -. [Thesis]. Aligarh Muslim University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28650

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

29. Bakhshi, Ziaul Hassan. Stochastic integer programming in stratified sampling; -.

Degree: Statistics, 2014, Aligarh Muslim University

non

Bibliography p.90-114

Advisors/Committee Members: Mohammad, Masood Khalid.

Subjects/Keywords: Stochastic; Programming; Sampling; Stochastic Integer

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bakhshi, Z. H. (2014). Stochastic integer programming in stratified sampling; -. (Thesis). Aligarh Muslim University. Retrieved from http://shodhganga.inflibnet.ac.in/handle/10603/28678

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):

Bakhshi, Ziaul Hassan. “Stochastic integer programming in stratified sampling; -.” 2014. Thesis, Aligarh Muslim University. Accessed April 17, 2021. http://shodhganga.inflibnet.ac.in/handle/10603/28678.

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

MLA Handbook (7th Edition):

Bakhshi, Ziaul Hassan. “Stochastic integer programming in stratified sampling; -.” 2014. Web. 17 Apr 2021.

Vancouver:

Bakhshi ZH. Stochastic integer programming in stratified sampling; -. [Internet] [Thesis]. Aligarh Muslim University; 2014. [cited 2021 Apr 17]. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28678.

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

Council of Science Editors:

Bakhshi ZH. Stochastic integer programming in stratified sampling; -. [Thesis]. Aligarh Muslim University; 2014. Available from: http://shodhganga.inflibnet.ac.in/handle/10603/28678

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


Columbia University

30. Bhat, Nikhil. Tractable approximation algorithms for high dimensional sequential optimization problems.

Degree: 2016, Columbia University

 Sequential decision making problems are ubiquitous in a number of research areas such as operations research, finance, engineering and computer science. The main challenge with… (more)

Subjects/Keywords: Dynamic programming; Stochastic approximation; Stochastic control theory; Markov processes; Operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Bhat, N. (2016). Tractable approximation algorithms for high dimensional sequential optimization problems. (Doctoral Dissertation). Columbia University. Retrieved from https://doi.org/10.7916/D8JQ10W8

Chicago Manual of Style (16th Edition):

Bhat, Nikhil. “Tractable approximation algorithms for high dimensional sequential optimization problems.” 2016. Doctoral Dissertation, Columbia University. Accessed April 17, 2021. https://doi.org/10.7916/D8JQ10W8.

MLA Handbook (7th Edition):

Bhat, Nikhil. “Tractable approximation algorithms for high dimensional sequential optimization problems.” 2016. Web. 17 Apr 2021.

Vancouver:

Bhat N. Tractable approximation algorithms for high dimensional sequential optimization problems. [Internet] [Doctoral dissertation]. Columbia University; 2016. [cited 2021 Apr 17]. Available from: https://doi.org/10.7916/D8JQ10W8.

Council of Science Editors:

Bhat N. Tractable approximation algorithms for high dimensional sequential optimization problems. [Doctoral Dissertation]. Columbia University; 2016. Available from: https://doi.org/10.7916/D8JQ10W8

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

.