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 +publisher:"Cornell University" +contributor:("Henderson, Shane G."). Showing records 1 – 18 of 18 total matches.

Search Limiters

Last 2 Years | English Only

No search limiters apply to these results.

▼ Search Limiters


Cornell University

1. Xiong, Qinyuan. A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II.

Degree: M.S., Civil and Environmental Engineering, Civil and Environmental Engineering, 2017, Cornell University

 This thesis focuses on the transit network design problem, where the focus is on understanding the trade-off between user costs and system owner cost. Given… (more)

Subjects/Keywords: Operations research; Transportation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xiong, Q. (2017). A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II. (Masters Thesis). Cornell University. Retrieved from http://hdl.handle.net/1813/51593

Chicago Manual of Style (16th Edition):

Xiong, Qinyuan. “A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II.” 2017. Masters Thesis, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/51593.

MLA Handbook (7th Edition):

Xiong, Qinyuan. “A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II.” 2017. Web. 17 Jan 2021.

Vancouver:

Xiong Q. A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II. [Internet] [Masters thesis]. Cornell University; 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/51593.

Council of Science Editors:

Xiong Q. A Procedure of Solving Transit Network Design Problem Based on a Non-Dominated Sorting Algorithm of NSGA II. [Masters Thesis]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/51593


Cornell University

2. Ma, Sijia. SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY.

Degree: PhD, Operations Research, 2018, Cornell University

 Ranking and selection (R&S) procedures are widely used for selecting the best among a set of candidate systems, where each candidate system is associated with… (more)

Subjects/Keywords: Parallel Computing; Ranking and Selection; Sample Complexity; simulation optimization; Operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, S. (2018). SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/64955

Chicago Manual of Style (16th Edition):

Ma, Sijia. “SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY.” 2018. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/64955.

MLA Handbook (7th Edition):

Ma, Sijia. “SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY.” 2018. Web. 17 Jan 2021.

Vancouver:

Ma S. SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY. [Internet] [Doctoral dissertation]. Cornell University; 2018. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/64955.

Council of Science Editors:

Ma S. SEQUENTIAL RANKING AND SELECTION PROCEDURES AND SAMPLE COMPLEXITY. [Doctoral Dissertation]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/64955


Cornell University

3. Qian, Jiawei. Prize-Collecting Network Design.

Degree: PhD, Operations Research, 2012, Cornell University

 Network design is an active research area in discrete optimization that focuses on problems arising from the construction of communication networks. The prize-collecting version of… (more)

Subjects/Keywords: Network design; Approximation algorithm; Online algorithm

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Qian, J. (2012). Prize-Collecting Network Design. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/29363

Chicago Manual of Style (16th Edition):

Qian, Jiawei. “Prize-Collecting Network Design.” 2012. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/29363.

MLA Handbook (7th Edition):

Qian, Jiawei. “Prize-Collecting Network Design.” 2012. Web. 17 Jan 2021.

Vancouver:

Qian J. Prize-Collecting Network Design. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/29363.

Council of Science Editors:

Qian J. Prize-Collecting Network Design. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/29363


Cornell University

4. Kumar, Ravi. Dynamic Resource Management For Systems With Controllable Service Capacity.

Degree: PhD, Operations Research, 2015, Cornell University

 The rise in the Internet traffic volumes has led to a growing interest in reducing energy costs of IT infrastructure. Resource management policies for such… (more)

Subjects/Keywords: Markov Decision Process; Service Rate Control; Dynamic Power Management

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Kumar, R. (2015). Dynamic Resource Management For Systems With Controllable Service Capacity. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/41011

Chicago Manual of Style (16th Edition):

Kumar, Ravi. “Dynamic Resource Management For Systems With Controllable Service Capacity.” 2015. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/41011.

MLA Handbook (7th Edition):

Kumar, Ravi. “Dynamic Resource Management For Systems With Controllable Service Capacity.” 2015. Web. 17 Jan 2021.

Vancouver:

Kumar R. Dynamic Resource Management For Systems With Controllable Service Capacity. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/41011.

Council of Science Editors:

Kumar R. Dynamic Resource Management For Systems With Controllable Service Capacity. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/41011


Cornell University

5. Rayfield, William. Pricing And Assortment Problems Under Correlated Product Evaluations.

Degree: PhD, Operations Research, 2014, Cornell University

 In many retail settings, demand for a certain product is determined not only by its own attributes but also by the attributes of other products,… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Rayfield, W. (2014). Pricing And Assortment Problems Under Correlated Product Evaluations. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/38946

Chicago Manual of Style (16th Edition):

Rayfield, William. “Pricing And Assortment Problems Under Correlated Product Evaluations.” 2014. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/38946.

MLA Handbook (7th Edition):

Rayfield, William. “Pricing And Assortment Problems Under Correlated Product Evaluations.” 2014. Web. 17 Jan 2021.

Vancouver:

Rayfield W. Pricing And Assortment Problems Under Correlated Product Evaluations. [Internet] [Doctoral dissertation]. Cornell University; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/38946.

Council of Science Editors:

Rayfield W. Pricing And Assortment Problems Under Correlated Product Evaluations. [Doctoral Dissertation]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/38946


Cornell University

6. Zayas-Caban, Gabriel. Dynamic Allocation Of Healthcare Resources.

Degree: PhD, Applied Mathematics, 2015, Cornell University

 This thesis collects two papers proposing systematic frameworks for dynamic (i.e. state dependent) resource allocation in healthcare delivery. The first focuses on disaster response, and… (more)

Subjects/Keywords: stochastic dynamic programming and/or Ma; resource allocation; queues

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Zayas-Caban, G. (2015). Dynamic Allocation Of Healthcare Resources. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/39341

Chicago Manual of Style (16th Edition):

Zayas-Caban, Gabriel. “Dynamic Allocation Of Healthcare Resources.” 2015. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/39341.

MLA Handbook (7th Edition):

Zayas-Caban, Gabriel. “Dynamic Allocation Of Healthcare Resources.” 2015. Web. 17 Jan 2021.

Vancouver:

Zayas-Caban G. Dynamic Allocation Of Healthcare Resources. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/39341.

Council of Science Editors:

Zayas-Caban G. Dynamic Allocation Of Healthcare Resources. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/39341


Cornell University

7. Xie, Jing. Bayesian Designs For Sequential Learning Problems.

Degree: PhD, Operations Research, 2014, Cornell University

 We consider the Bayesian formulation of a number of learning problems, where we focus on sequential sampling procedures for allocating simulation effort efficiently. We derive… (more)

Subjects/Keywords: Bayesian Statistics; Simulation; Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Xie, J. (2014). Bayesian Designs For Sequential Learning Problems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/37171

Chicago Manual of Style (16th Edition):

Xie, Jing. “Bayesian Designs For Sequential Learning Problems.” 2014. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/37171.

MLA Handbook (7th Edition):

Xie, Jing. “Bayesian Designs For Sequential Learning Problems.” 2014. Web. 17 Jan 2021.

Vancouver:

Xie J. Bayesian Designs For Sequential Learning Problems. [Internet] [Doctoral dissertation]. Cornell University; 2014. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/37171.

Council of Science Editors:

Xie J. Bayesian Designs For Sequential Learning Problems. [Doctoral Dissertation]. Cornell University; 2014. Available from: http://hdl.handle.net/1813/37171


Cornell University

8. Ma, Yuhang. ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS.

Degree: PhD, Operations Research and Information Engineering, 2019, Cornell University

 In most E-commerce scenarios such as hotel booking and online shopping, products are not offered to customers simultaneously. Instead, they are divided into different webpages… (more)

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Ma, Y. (2019). ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/70009

Chicago Manual of Style (16th Edition):

Ma, Yuhang. “ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS.” 2019. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/70009.

MLA Handbook (7th Edition):

Ma, Yuhang. “ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS.” 2019. Web. 17 Jan 2021.

Vancouver:

Ma Y. ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS. [Internet] [Doctoral dissertation]. Cornell University; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/70009.

Council of Science Editors:

Ma Y. ASSORTMENT OPTIMIZATION AND PRICING PROBLEMS UNDER MULTI-STAGE MULTINOMIAL LOGIT MODELS. [Doctoral Dissertation]. Cornell University; 2019. Available from: http://hdl.handle.net/1813/70009


Cornell University

9. Maxwell, Matthew. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment.

Degree: PhD, Operations Research, 2011, Cornell University

 Ambulance redeployment is the practice of dynamically relocating idle ambulances based upon real-time information to reduce expected response times for future emergency calls. Ambulance redeployment… (more)

Subjects/Keywords: emergency services; approximate dynamic programming; post-decision state

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Maxwell, M. (2011). Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/29425

Chicago Manual of Style (16th Edition):

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment.” 2011. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/29425.

MLA Handbook (7th Edition):

Maxwell, Matthew. “Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment.” 2011. Web. 17 Jan 2021.

Vancouver:

Maxwell M. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment. [Internet] [Doctoral dissertation]. Cornell University; 2011. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/29425.

Council of Science Editors:

Maxwell M. Approximate Dynamic Programming Policies And Performance Bounds For Ambulance Redeployment. [Doctoral Dissertation]. Cornell University; 2011. Available from: http://hdl.handle.net/1813/29425


Cornell University

10. Waeber, Rolf. Probabilistic Bisection Search For Stochastic Root-Finding.

Degree: PhD, Operations Research, 2013, Cornell University

 The goal of a stochastic root-finding algorithm is to locate a point x* such that g (x* ) = 0 for a given function g(more)

Subjects/Keywords: Probabilistic Bisection; Stochastic Root-Finding; Simulation-Optimization

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Waeber, R. (2013). Probabilistic Bisection Search For Stochastic Root-Finding. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/33929

Chicago Manual of Style (16th Edition):

Waeber, Rolf. “Probabilistic Bisection Search For Stochastic Root-Finding.” 2013. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/33929.

MLA Handbook (7th Edition):

Waeber, Rolf. “Probabilistic Bisection Search For Stochastic Root-Finding.” 2013. Web. 17 Jan 2021.

Vancouver:

Waeber R. Probabilistic Bisection Search For Stochastic Root-Finding. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/33929.

Council of Science Editors:

Waeber R. Probabilistic Bisection Search For Stochastic Root-Finding. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/33929


Cornell University

11. King, Kathleen. Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies.

Degree: PhD, Operations Research, 2012, Cornell University

 Public health emergencies require rapid responses from federal, state, and local authorities to prevent widespread mortality and morbidity. However, existing response plans seldom account for… (more)

Subjects/Keywords: emergency preparedness; supply chain; anthrax

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

King, K. (2012). Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/31072

Chicago Manual of Style (16th Edition):

King, Kathleen. “Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies.” 2012. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/31072.

MLA Handbook (7th Edition):

King, Kathleen. “Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies.” 2012. Web. 17 Jan 2021.

Vancouver:

King K. Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies. [Internet] [Doctoral dissertation]. Cornell University; 2012. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/31072.

Council of Science Editors:

King K. Logistical Models For Planning And Operating Medical Countermeasure Distribution Networks During Public Health Emergencies. [Doctoral Dissertation]. Cornell University; 2012. Available from: http://hdl.handle.net/1813/31072

12. Jian, Nanjing. EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION.

Degree: PhD, Operations Research, 2017, Cornell University

 The thesis explores how to solve simulation-based optimization problems more efficiently using information about the problem structure. Two primary ideas are explored. The first idea… (more)

Subjects/Keywords: Statistics; Operations research; bike-sharing; call center; convexity; simulation optimization; variance reduction

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Jian, N. (2017). EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/56927

Chicago Manual of Style (16th Edition):

Jian, Nanjing. “EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION.” 2017. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/56927.

MLA Handbook (7th Edition):

Jian, Nanjing. “EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION.” 2017. Web. 17 Jan 2021.

Vancouver:

Jian N. EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/56927.

Council of Science Editors:

Jian N. EXPLORING AND EXPLOITING STRUCTURE IN LARGE SCALE SIMULATION OPTIMIZATION. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/56927

13. Pallone, Stephen Nicholas. Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning.

Degree: PhD, Operations Research, 2017, Cornell University

 Many fundamental problems in mathematics can be considered search problems, where one can make sequential queries to find a point with desired properties. This includes… (more)

Subjects/Keywords: preferences; Operations research; active learning; bayesian; bisection search; information theory

…Probabilistic bisection search for stochastic root-finding. Cornell University, 2013. [12]… 

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

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Pallone, S. N. (2017). Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/56903

Chicago Manual of Style (16th Edition):

Pallone, Stephen Nicholas. “Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning.” 2017. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/56903.

MLA Handbook (7th Edition):

Pallone, Stephen Nicholas. “Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning.” 2017. Web. 17 Jan 2021.

Vancouver:

Pallone SN. Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/56903.

Council of Science Editors:

Pallone SN. Adaptive Bayes-Optimal Methods for Stochastic Search with Applications to Preference Learning. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/56903

14. Eckman, David. Reconsidering Ranking-and-Selection Guarantees.

Degree: PhD, Operations Research and Information Engineering, 2019, Cornell University

 This dissertation deals with the various statistical guarantees delivered by ranking-and-selection (R&S) procedures: a class of methods designed for the problem of selecting the best… (more)

Subjects/Keywords: Statistics; Ranking and Selection; Industrial engineering; simulation optimization; Operations research

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Eckman, D. (2019). Reconsidering Ranking-and-Selection Guarantees. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/67385

Chicago Manual of Style (16th Edition):

Eckman, David. “Reconsidering Ranking-and-Selection Guarantees.” 2019. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/67385.

MLA Handbook (7th Edition):

Eckman, David. “Reconsidering Ranking-and-Selection Guarantees.” 2019. Web. 17 Jan 2021.

Vancouver:

Eckman D. Reconsidering Ranking-and-Selection Guarantees. [Internet] [Doctoral dissertation]. Cornell University; 2019. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/67385.

Council of Science Editors:

Eckman D. Reconsidering Ranking-and-Selection Guarantees. [Doctoral Dissertation]. Cornell University; 2019. Available from: http://hdl.handle.net/1813/67385

15. Steele, Patrick Robert. Vehicle Routing Problems.

Degree: PhD, Operations Research, 2017, Cornell University

 In this dissertation we consider variants of the vehicle routing problem applied to two problem areas. First, we consider the problem of scheduling deliveries from… (more)

Subjects/Keywords: Vehicle routing problems; Operations research; Competitive algorithms; Simulation

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Steele, P. R. (2017). Vehicle Routing Problems. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/47797

Chicago Manual of Style (16th Edition):

Steele, Patrick Robert. “Vehicle Routing Problems.” 2017. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/47797.

MLA Handbook (7th Edition):

Steele, Patrick Robert. “Vehicle Routing Problems.” 2017. Web. 17 Jan 2021.

Vancouver:

Steele PR. Vehicle Routing Problems. [Internet] [Doctoral dissertation]. Cornell University; 2017. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/47797.

Council of Science Editors:

Steele PR. Vehicle Routing Problems. [Doctoral Dissertation]. Cornell University; 2017. Available from: http://hdl.handle.net/1813/47797

16. Girard, Cory Jay. Structural Results for Constrained Markov Decision Processes.

Degree: PhD, Operations Research, 2018, Cornell University

 In the existing literature on the dynamic control of service systems, a decision-maker seeks to optimize a single performance metric over a given time-horizon. However,… (more)

Subjects/Keywords: applied probability; Operations research; queueing theory; constrained optimization; dynamic programming; Markov decision processes; Optimal control

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Girard, C. J. (2018). Structural Results for Constrained Markov Decision Processes. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/59539

Chicago Manual of Style (16th Edition):

Girard, Cory Jay. “Structural Results for Constrained Markov Decision Processes.” 2018. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/59539.

MLA Handbook (7th Edition):

Girard, Cory Jay. “Structural Results for Constrained Markov Decision Processes.” 2018. Web. 17 Jan 2021.

Vancouver:

Girard CJ. Structural Results for Constrained Markov Decision Processes. [Internet] [Doctoral dissertation]. Cornell University; 2018. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/59539.

Council of Science Editors:

Girard CJ. Structural Results for Constrained Markov Decision Processes. [Doctoral Dissertation]. Cornell University; 2018. Available from: http://hdl.handle.net/1813/59539

17. Westgate, Bradford. Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods.

Degree: PhD, Operations Research, 2013, Cornell University

 We introduce two statistical methods for estimating vehicle travel time distributions on a road network, using Global Positioning System (GPS) data recorded during historical vehicle… (more)

Subjects/Keywords: Emergency medical services; Global Positioning System; Metropolis-Hastings sampling

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Westgate, B. (2013). Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/34155

Chicago Manual of Style (16th Edition):

Westgate, Bradford. “Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods.” 2013. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/34155.

MLA Handbook (7th Edition):

Westgate, Bradford. “Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods.” 2013. Web. 17 Jan 2021.

Vancouver:

Westgate B. Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods. [Internet] [Doctoral dissertation]. Cornell University; 2013. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/34155.

Council of Science Editors:

Westgate B. Vehicle Travel Time Distribution Estimation And Map-Matching Via Markov Chain Monte Carlo Methods. [Doctoral Dissertation]. Cornell University; 2013. Available from: http://hdl.handle.net/1813/34155


Cornell University

18. Alden, Jonathan. Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors.

Degree: PhD, Applied Physics, 2015, Cornell University

Record DetailsSimilar RecordsGoogle PlusoneFacebookTwitterCiteULikeMendeleyreddit

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

APA (6th Edition):

Alden, J. (2015). Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors. (Doctoral Dissertation). Cornell University. Retrieved from http://hdl.handle.net/1813/40656

Chicago Manual of Style (16th Edition):

Alden, Jonathan. “Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors.” 2015. Doctoral Dissertation, Cornell University. Accessed January 17, 2021. http://hdl.handle.net/1813/40656.

MLA Handbook (7th Edition):

Alden, Jonathan. “Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors.” 2015. Web. 17 Jan 2021.

Vancouver:

Alden J. Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors. [Internet] [Doctoral dissertation]. Cornell University; 2015. [cited 2021 Jan 17]. Available from: http://hdl.handle.net/1813/40656.

Council of Science Editors:

Alden J. Strain Solitons And Nanotube-Aligned Nanopore Dna Sensors. [Doctoral Dissertation]. Cornell University; 2015. Available from: http://hdl.handle.net/1813/40656

.