Jeffrey W. Ohlmann

Orcid: 0000-0002-1737-4717

According to our database1, Jeffrey W. Ohlmann authored at least 30 papers between 2004 and 2021.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Direct k-routing versus cross-docking: worst-case results.
Optim. Lett., 2021

2020
Multi-period orienteering with uncertain adoption likelihood and waiting at customers.
Eur. J. Oper. Res., 2020

An exact approach for cyclic inbound inventory routing in a level production system.
Eur. J. Oper. Res., 2020

2019
The turf is always greener: Predicting decommitments in college football recruiting using Twitter data.
Decis. Support Syst., 2019

Keeping it 100: Social Media and Self-Presentation in College Football Recruiting.
Big Data, 2019

2018
Dynamic Orienteering on a Network of Queues.
Transp. Sci., 2018

Model-based capacitated clustering with posterior regularization.
Eur. J. Oper. Res., 2018

2017
A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs.
Eur. J. Oper. Res., 2017

Online and Off the Field: Predicting School Choice in College Football Recruiting from Social Media Data.
Decis. Anal., 2017

Generalized Inverse Classification.
Proceedings of the 2017 SIAM International Conference on Data Mining, 2017

2016
Restocking-Based Rollout Policies for the Vehicle Routing Problem with Stochastic Demand and Duration Limits.
Transp. Sci., 2016

Analysis of monday night football viewership.
Stat. Anal. Data Min., 2016

2014
A priori orienteering with time windows and stochastic wait times at customers.
Eur. J. Oper. Res., 2014

Determining Transportation Mode Choice To Minimize Distribution Cost: Direct Shipping, Transit Point And 2-Routing.
Proceedings of the 28th European Conference on Modelling and Simulation, 2014

A Memetic Heuristic for the Co-clustering Problem.
Proceedings of the 8th International Conference on Bio-inspired Information and Communications Technologies, 2014

2013
Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits.
Oper. Res., 2013

The travelling salesman problem with time windows: Adapting algorithms from travel-time to makespan optimization.
Appl. Soft Comput., 2013

2012
Introduction to the Special Issue on Analytics in Sports, Part II: Sports Scheduling Applications.
Interfaces, 2012

Introduction to the Special Issue on Analytics in Sports, Part I: General Sports Applications.
Interfaces, 2012

Cyclic-order neighborhoods with application to the vehicle routing problem with stochastic demand.
Eur. J. Oper. Res., 2012

2011
A randomized Delaunay triangulation heuristic for the Euclidean Steiner tree problem in <i>ℜ</i><sup><i>d</i></sup>.
J. Heuristics, 2011

An integer programming model for optimal pork marketing.
Ann. Oper. Res., 2011

2010
An agent-based stochastic ruler approach for a stochastic knapsack problem with sequential competition.
Comput. Oper. Res., 2010

2009
Call for Papers - <i>Interfaces</i> Special Issue: Analytics in Sports.
Interfaces, 2009

Route Design for Delivery of Voting Machines in Hamilton County, Ohio.
Interfaces, 2009

Resource-constrained management of heterogeneous assets with stochastic deterioration.
Eur. J. Oper. Res., 2009

2008
Route Design for Lean Production Systems.
Transp. Sci., 2008

Long-range timber supply planning for a vertically integrated paper mill.
Eur. J. Oper. Res., 2008

2007
A Compressed-Annealing Heuristic for the Traveling Salesman Problem with Time Windows.
INFORMS J. Comput., 2007

2004
Convergence in Probability of Compressed Annealing.
Math. Oper. Res., 2004


  Loading...