Mike Hewitt

Orcid: 0000-0002-9786-677X

According to our database1, Mike Hewitt authored at least 37 papers between 1986 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A continuous-time service network design and vehicle routing problem.
Networks, March, 2024

2023
Solving Time-Dependent Traveling Salesman Problem with Time Windows Under Generic Time-Dependent Travel Cost.
Proceedings of the Computational Data and Social Networks - 12th International Conference, 2023

2022
The Flexible Scheduled Service Network Design Problem.
Transp. Sci., 2022

Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery.
Eur. J. Oper. Res., 2022

Meta partial benders decomposition for the logistics service network design problem.
Eur. J. Oper. Res., 2022

Decision-based scenario clustering for decision-making under uncertainty.
Ann. Oper. Res., 2022

2021
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem.
Transp. Sci., 2021

Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design.
Transp. Sci., 2021

"Make no little plans": Impactful research to solve the next generation of transportation problems.
Networks, 2021

Managing uncertainty in demand through inventory and workforce development.
Int. J. Prod. Res., 2021

2020
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows.
Transp. Sci., 2020

Data-driven optimization model customization.
Eur. J. Oper. Res., 2020

A Benders decomposition-based approach for logistics service network design.
Eur. J. Oper. Res., 2020

2019
Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem.
Transp. Sci., 2019

An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems.
Networks, 2019

Mileage bands in freight transportation.
Eur. J. Oper. Res., 2019

Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem.
EURO J. Transp. Logist., 2019

The price of discretizing time: a study in service network design.
EURO J. Transp. Logist., 2019

2018
Special Issue on Uncertainty in Logistics and Transportation Systems.
Transp. Sci., 2018

Workforce grouping and assignment with learning-by-doing and knowledge transfer.
Int. J. Prod. Res., 2018

Scheduled service network design with resource acquisition and management.
EURO J. Transp. Logist., 2018

2017
The Continuous-Time Service Network Design Problem.
Oper. Res., 2017

A matheuristic for workforce planning with employee learning and stochastic demand.
Int. J. Prod. Res., 2017

Multi-period technician scheduling with experience-based service times and stochastic customers.
Comput. Oper. Res., 2017

Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming, 2017

2016
Service Network Design with Resource Constraints.
Transp. Sci., 2016

Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning.
Comput. Ind. Eng., 2016

Planning Strategies for Home Health Care Delivery.
Asia Pac. J. Oper. Res., 2016

2015
Consolidating home meal delivery with limited operational disruption.
Eur. J. Oper. Res., 2015

Integer programming techniques for solving non-linear workforce planning models with learning.
Eur. J. Oper. Res., 2015

2014
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design.
Comput. Oper. Res., 2014

2013
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem.
INFORMS J. Comput., 2013

A branch-and-price guided search approach to maritime inventory routing.
Comput. Oper. Res., 2013

2012
Branch-and-Price Guided Search - (Extended Abstract).
Proceedings of the Combinatorial Optimization - Second International Symposium, 2012

2010
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem.
INFORMS J. Comput., 2010

2009
Using Branch-and-Price to Find High Quality Solutions Quickly.
Proceedings of the Models and Algorithms for Optimization in Logistics, 21.06., 2009

1986
PROTEAN: Deriving Protein Structure from Constraints.
Proceedings of the 5th National Conference on Artificial Intelligence. Philadelphia, 1986


  Loading...