Year |
Citation |
Score |
2020 |
Ulmer MW, Thomas BW, Campbell AM, Woyak N. The Restaurant Meal Delivery Problem: Dynamic Pickup and Delivery with Deadlines and Random Ready Times Transportation Science. DOI: 10.1287/Trsc.2020.1000 |
0.372 |
|
2020 |
Song Y, Ulmer MW, Thomas BW, Wallace SW. Building Trust in Home Services—Stochastic Team-Orienteering with Consistency Constraints Transportation Science. 54: 823-838. DOI: 10.1287/Trsc.2019.0927 |
0.391 |
|
2020 |
Ulmer MW, Goodson JC, Mattfeld DC, Thomas BW. On modeling stochastic dynamic vehicle routing problems Euro Journal On Transportation and Logistics. 9: 100008. DOI: 10.1016/J.Ejtl.2020.100008 |
0.436 |
|
2020 |
Zhang S, Ohlmann JW, Thomas BW. Multi-period orienteering with uncertain adoption likelihood and waiting at customers European Journal of Operational Research. 282: 288-303. DOI: 10.1016/J.Ejor.2019.09.023 |
0.488 |
|
2020 |
Ulmer MW, Thomas BW. Meso-parametric value function approximation for dynamic customer acceptances in delivery routing European Journal of Operational Research. 285: 183-195. DOI: 10.1016/J.Ejor.2019.04.029 |
0.433 |
|
2019 |
Ulmer MW, Thomas BW, Mattfeld DC. Preemptive depot returns for dynamic same-day delivery Euro Journal On Transportation and Logistics. 8: 327-361. DOI: 10.1007/S13676-018-0124-0 |
0.39 |
|
2019 |
Jin H, Thomas BW. Team orienteering with uncertain rewards and service times with an application to phlebotomist intrahospital routing Networks. 73: 453-465. DOI: 10.1002/Net.21875 |
0.352 |
|
2019 |
Thomas BW, Calogiuri T, Hewitt M. An exact bidirectional A⋆ approach for solving resource‐constrained shortest path problems Networks. 73: 187-205. DOI: 10.1002/Net.21856 |
0.381 |
|
2018 |
Zhang S, Ohlmann JW, Thomas BW. Dynamic Orienteering on a Network of Queues Transportation Science. 52: 691-706. DOI: 10.1287/Trsc.2017.0761 |
0.458 |
|
2018 |
Ehmke JF, Campbell AM, Thomas BW. Optimizing for total costs in vehicle routing in urban areas Transportation Research Part E-Logistics and Transportation Review. 116: 242-265. DOI: 10.1016/J.Tre.2018.06.008 |
0.355 |
|
2018 |
Chen X, Hewitt M, Thomas BW. An approximate dynamic programming method for the multi-period technician scheduling problem with experience-based service times and stochastic customers International Journal of Production Economics. 196: 122-134. DOI: 10.1016/J.Ijpe.2017.10.028 |
0.394 |
|
2017 |
Voccia SA, Campbell AM, Thomas BW. The Same-Day Delivery Problem for Online Purchases Transportation Science. 53: 167-184. DOI: 10.1287/Trsc.2016.0732 |
0.408 |
|
2017 |
Lamsal K, Jones PC, Thomas BW. Sugarcane Harvest Logistics in Brazil Transportation Science. 51: 771-789. DOI: 10.1287/Trsc.2015.0650 |
0.716 |
|
2017 |
Valeva S, Hewitt M, Thomas BW, Brown KG. Balancing flexibility and inventory in workforce planning with learning International Journal of Production Economics. 183: 194-207. DOI: 10.1016/J.Ijpe.2016.10.026 |
0.393 |
|
2017 |
Goodson JC, Thomas BW, Ohlmann JW. A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs European Journal of Operational Research. 258: 216-229. DOI: 10.1016/J.Ejor.2016.09.040 |
0.404 |
|
2017 |
Chen X, Thomas BW, Hewitt M. Multi-period technician scheduling with experience-based service times and stochastic customers Computers & Operations Research. 82: 1-14. DOI: 10.1016/J.Cor.2016.12.026 |
0.485 |
|
2016 |
Goodson JC, Thomas BW, Ohlmann JW. Restocking-based rollout policies for the vehicle routing problem with stochastic demand and duration limits Transportation Science. 50: 591-607. DOI: 10.1287/Trsc.2015.0591 |
0.425 |
|
2016 |
Lamsal K, Jones PC, Thomas BW. Continuous time scheduling for sugarcane harvest logistics in Louisiana International Journal of Production Research. 54: 616-627. DOI: 10.1080/00207543.2015.1052156 |
0.707 |
|
2016 |
Chen X, Thomas BW, Hewitt M. The technician routing problem with experience-based service times Omega (United Kingdom). 61: 49-61. DOI: 10.1016/J.Omega.2015.07.006 |
0.453 |
|
2016 |
Ehmke JF, Campbell AM, Thomas BW. Data-driven approaches for emissions-minimized paths in urban areas Computers and Operations Research. 67: 34-47. DOI: 10.1016/J.Cor.2015.08.013 |
0.37 |
|
2016 |
Jin H, Thomas BW, Hewit M. Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning Computers and Industrial Engineering. 97: 202-211. DOI: 10.1016/J.Cie.2016.03.027 |
0.454 |
|
2016 |
Lamsal K, Jones PC, Thomas BW. Harvest logistics in agricultural systems with multiple, independent producers and no on-farm storage Computers and Industrial Engineering. 91: 129-138. DOI: 10.1016/J.Cie.2015.10.018 |
0.691 |
|
2015 |
Ehmke JF, Campbell AM, Thomas BW. Vehicle routing to minimize time-dependent emissions in urban areas European Journal of Operational Research. DOI: 10.1016/J.Ejor.2015.11.034 |
0.392 |
|
2015 |
Hewitt M, Chacosky A, Grasman SE, Thomas BW. Integer programming techniques for solving non-linear workforce planning models with learning European Journal of Operational Research. 242: 942-950. DOI: 10.1016/J.Ejor.2014.10.060 |
0.385 |
|
2014 |
Zhang S, Ohlmann JW, Thomas BW. A priori orienteering with time windows and stochastic wait times at customers European Journal of Operational Research. 239: 70-79. DOI: 10.1016/J.Ejor.2014.04.040 |
0.508 |
|
2014 |
Thomas BW, Manni E. Scheduled penalty Variable Neighborhood Search Computers and Operations Research. 52: 170-180. DOI: 10.1016/J.Cor.2013.12.004 |
0.443 |
|
2013 |
Grasman SE, Thomas BW. Scrambled experts: Team handicaps and win probabilities for golf scrambles Journal of Quantitative Analysis in Sports. 9: 217-227. DOI: 10.1515/Jqas-2012-0024 |
0.325 |
|
2013 |
Goodson JC, Ohlmann JW, Thomas BW. Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits Operations Research. 61: 138-154. DOI: 10.1287/Opre.1120.1127 |
0.398 |
|
2013 |
López-Ibáñez M, Blum C, Ohlmann JW, Thomas BW. The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization Applied Soft Computing Journal. 13: 3806-3815. DOI: 10.1016/J.Asoc.2013.05.009 |
0.458 |
|
2013 |
Voccia SA, Campbell AM, Thomas BW. The probabilistic traveling salesman problem with time windows Euro Journal On Transportation and Logistics. 2: 89-107. DOI: 10.1007/S13676-013-0018-0 |
0.503 |
|
2012 |
Ghiani G, Manni E, Thomas BW. A comparison of anticipatory algorithms for the dynamic and stochastic traveling salesman problem Transportation Science. 46: 374-387. DOI: 10.1287/Trsc.1110.0374 |
0.427 |
|
2012 |
Goodson JC, Ohlmann JW, Thomas BW. Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand European Journal of Operational Research. 217: 312-323. DOI: 10.1016/J.Ejor.2011.09.023 |
0.445 |
|
2012 |
Chen H, Campbell AM, Thomas BW. Network design for time-constrained delivery using subgraphs Computational Management Science. 9: 531-542. DOI: 10.1007/S10287-012-0154-2 |
0.405 |
|
2011 |
Campbell AM, Gendreau M, Thomas BW. The orienteering problem with stochastic travel and service times Annals of Operations Research. 186: 61-81. DOI: 10.1007/S10479-011-0895-2 |
0.486 |
|
2009 |
Sim T, Lowe TJ, Thomas BW. The stochastic p-hub center problem with service-level constraints Computers and Operations Research. 36: 3166-3177. DOI: 10.1016/J.Cor.2008.11.020 |
0.686 |
|
2009 |
Campbell AM, Thomas BW. Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines Computers and Operations Research. 36: 1231-1248. DOI: 10.1016/J.Cor.2008.01.006 |
0.428 |
|
2009 |
Chen H, Campbell A, Thomas B, Tamir A. Minimax flow tree problems Networks. 54: 117-129. DOI: 10.1002/Net.V54:3 |
0.381 |
|
2008 |
Ohlmann JW, Fry MJ, Thomas BW. Route Design for Lean Production Systems Transportation Science. 42: 352-370. DOI: 10.1287/Trsc.1070.0222 |
0.46 |
|
2008 |
Campbell AM, Thomas BW. Probabilistic traveling salesman problem with deadlines Transportation Science. 42: 1-21. DOI: 10.1287/Trsc.1070.0203 |
0.513 |
|
2008 |
Chen H, Campbell AM, Thomas BW. Network design for time-constrained delivery Naval Research Logistics. 55: 493-515. DOI: 10.1002/Nav.20302 |
0.415 |
|
2007 |
Thomas BW. Waiting strategies for anticipating service requests from known customer locations Transportation Science. 41: 319-331. DOI: 10.1287/Trsc.1060.0183 |
0.475 |
|
2007 |
Ohlmann JW, Thomas BW. A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows Informs Journal On Computing. 19: 80-90. DOI: 10.1287/Ijoc.1050.0145 |
0.405 |
|
2007 |
Thomas BW, White CC. The dynamic shortest path problem with anticipation European Journal of Operational Research. 176: 836-854. DOI: 10.1016/J.Ejor.2005.09.019 |
0.422 |
|
2004 |
Thomas BW, White CC. Anticipatory route selection Transportation Science. 38: 473-487. DOI: 10.1287/Trsc.1030.0071 |
0.438 |
|
Show low-probability matches. |