Barrett W. Thomas Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo
DBLP keys2013
j13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Justin C. Goodson, Jeffrey W. Ohlmann, Barrett W. Thomas: Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits. Operations Research 61(1): 138-154 (2013)
2012
j12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Justin C. Goodson, Jeffrey W. Ohlmann, Barrett W. Thomas: Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand. European Journal of Operational Research 217(2): 312-323 (2012)
j11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Gianpaolo Ghiani, Emanuele Manni, Barrett W. Thomas: A Comparison of Anticipatory Algorithms for the Dynamic and Stochastic Traveling Salesman Problem. Transportation Science 46(3): 374-387 (2012)
2011
j10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ann Melissa Campbell, Michel Gendreau, Barrett W. Thomas: The orienteering problem with stochastic travel and service times. Annals OR 186(1): 61-81 (2011)
2009
j9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ann Melissa Campbell, Barrett W. Thomas: Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines. Computers & OR 36(4): 1231-1248 (2009)
j8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Thaddeus Sim, Timothy J. Lowe, Barrett W. Thomas: The stochastic p-hub center problem with service-level constraints. Computers & OR 36(12): 3166-3177 (2009)
j7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Hui Chen, Ann Melissa Campbell, Barrett W. Thomas, Arie Tamir: Minimax flow tree problems. Networks 54(3): 117-129 (2009)
2008
j6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Ann Melissa Campbell, Barrett W. Thomas: Probabilistic Traveling Salesman Problem with Deadlines. Transportation Science 42(1): 1-21 (2008)
j5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jeffrey W. Ohlmann, Michael J. Fry, Barrett W. Thomas: Route Design for Lean Production Systems. Transportation Science 42(3): 352-370 (2008)
2007
j4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Barrett W. Thomas, Chelsea C. White III: The dynamic shortest path problem with anticipation. European Journal of Operational Research 176(2): 836-854 (2007)
j3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Jeffrey W. Ohlmann, Barrett W. Thomas: A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows. INFORMS Journal on Computing 19(1): 80-90 (2007)
j2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Barrett W. Thomas: Waiting Strategies for Anticipating Service Requests from Known Customer Locations. Transportation Science 41(3): 319-331 (2007)
2004
j1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XML
Barrett W. Thomas, Chelsea C. White III: Anticipatory Route Selection. Transportation Science 38(4): 473-487 (2004)

Coauthor Index

1Ann Melissa Campbell
[j10] [j9] [j7] [j6]
2Hui Chen
[j7]
3Michael J. Fry
[j5]
4Michel Gendreau
[j10]
5Gianpaolo Ghiani
[j11]
6Justin C. Goodson
[j13] [j12]
7Timothy J. Lowe
[j8]
8Emanuele Manni
[j11]
9Jeffrey W. Ohlmann
[j13] [j12] [j5] [j3]
10Thaddeus Sim
[j8]
11Arie Tamir
[j7]
12Chelsea C. White III
[j4] [j1]

Colors in the list of coauthors

Last update Mon May 20 18:13:30 2013 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page