default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMike Hewitt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j33]Fotios Petropoulos
, Gilbert Laporte, Emel Aktas, Sibel A. Alumur, Claudia Archetti, Hayriye Ayhan, Maria Battarra, Julia A. Bennell, Jean-Marie Bourjolly, John E. Boylan, Michèle Breton, David Canca, Laurent Charlin, Bo Chen, Cihan Tugrul Cicek, Louis Anthony Cox, Christine S. M. Currie, Erik Demeulemeester, Li Ding, Stephen M. Disney, Matthias Ehrgott, Martin J. Eppler, Günes Erdogan, Bernard Fortz, L. Alberto Franco, Jens Frische, Salvatore Greco, Amanda J. Gregory, Raimo P. Hämäläinen, Willy Herroelen, Mike Hewitt, Jan Holmström, John N. Hooker, Tugçe Isik, Jill Johnes, Bahar Yetis Kara, Özlem Karsu, Katherine Kent, Charlotte Köhler, Martin H. Kunc, Yong-Hong Kuo, Adam N. Letchford, Janny Leung, Dong Li, Haitao Li, Judit Lienert, Ivana Ljubic, Andrea Lodi, Sebastián Lozano, Virginie Lurkin, Silvano Martello, Ian G. McHale, Gerald Midgley, John D. W. Morecroft, Akshay Mutha, Ceyda Oguz, Sanja Petrovic, Ulrich Pferschy, Harilaos N. Psaraftis, Sam Rose, Lauri Saarinen, Saïd Salhi, Jing-Sheng Song, Dimitrios Sotiros, Kathryn E. Stecke, Arne K. Strauss, Istenç Tarhan, Clemens Thielen, Paolo Toth, Tom Van Woensel, Greet Vanden Berghe, Christos Vasilakis, Vikrant Vaze, Daniele Vigo, Kai Virtanen, Xun Wang, Rafal Weron, Leroy White, Mike Yearworth, E. Alper Yildirim, Georges Zaccour, Xuying Zhao:
Operational Research: methods and applications. J. Oper. Res. Soc. 75(3): 423-617 (2024)- [j32]Yun He, Mike Hewitt, Fabien Lehuédé, Juliette Medina, Olivier Péton:
A continuous-time service network design and vehicle routing problem. Networks 83(2): 300-323 (2024) - 2023
- [c4]Duc Minh Vu, Mike Hewitt, Duc Duy Vu:
Solving Time-Dependent Traveling Salesman Problem with Time Windows Under Generic Time-Dependent Travel Cost. CSoNet 2023: 210-221 - [i3]Duc Minh Vu, Mike Hewitt, Duc Duy Vu:
Solving Time-Dependent Traveling Salesman Problem with Time Windows under Generic Time-Dependent Travel Cost. CoRR abs/2311.08111 (2023) - 2022
- [j31]Mike Hewitt, Janosch Ortmann, Walter Rei:
Decision-based scenario clustering for decision-making under uncertainty. Ann. Oper. Res. 315(2): 747-771 (2022) - [j30]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet:
Meta partial benders decomposition for the logistics service network design problem. Eur. J. Oper. Res. 300(2): 473-489 (2022) - [j29]Duc Minh Vu, Mike Hewitt, Duc D. Vu:
Solving the time dependent minimum tour duration and delivery man problems with dynamic discretization discovery. Eur. J. Oper. Res. 302(3): 831-846 (2022) - [j28]Mike Hewitt:
The Flexible Scheduled Service Network Design Problem. Transp. Sci. 56(4): 1000-1021 (2022) - 2021
- [j27]Silviya Valeva, Mike Hewitt, Barrett W. Thomas:
Managing uncertainty in demand through inventory and workforce development. Int. J. Prod. Res. 59(21): 6507-6527 (2021) - [j26]Niels A. H. Agatz, Mike Hewitt, Barrett W. Thomas:
"Make no little plans": Impactful research to solve the next generation of transportation problems. Networks 77(2): 269-286 (2021) - [j25]Luke Marshall, Natashia Boland, Martin W. P. Savelsbergh, Mike Hewitt:
Interval-Based Dynamic Discretization Discovery for Solving the Continuous-Time Service Network Design Problem. Transp. Sci. 55(1): 29-51 (2021) - [j24]Teodor Gabriel Crainic, Mike Hewitt, Francesca Maggioni, Walter Rei:
Partial Benders Decomposition: General Methodology and Application to Stochastic Network Design. Transp. Sci. 55(2): 414-435 (2021) - 2020
- [j23]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet, Tom Van Woensel:
A Benders decomposition-based approach for logistics service network design. Eur. J. Oper. Res. 286(2): 523-537 (2020) - [j22]Mike Hewitt, Emma Frejinger:
Data-driven optimization model customization. Eur. J. Oper. Res. 287(2): 438-451 (2020) - [j21]Duc Minh Vu, Mike Hewitt, Natashia Boland, Martin W. P. Savelsbergh:
Dynamic Discretization Discovery for Solving the Time-Dependent Traveling Salesman Problem with Time Windows. Transp. Sci. 54(3): 703-720 (2020) - [i2]Simon Belieres, Mike Hewitt, Nicolas Jozefowiez, Frédéric Semet:
Meta Partial Benders Decomposition for the Logistics Service Network Design Problem. CoRR abs/2009.14628 (2020)
2010 – 2019
- 2019
- [j20]Juliette Medina, Mike Hewitt, Fabien Lehuédé, Olivier Péton:
Integrating long-haul and local transportation planning: the Service Network Design and Routing Problem. EURO J. Transp. Logist. 8(2): 119-145 (2019) - [j19]Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh:
The price of discretizing time: a study in service network design. EURO J. Transp. Logist. 8(2): 195-216 (2019) - [j18]Maciek Nowak, Mike Hewitt, Hussam Bachour:
Mileage bands in freight transportation. Eur. J. Oper. Res. 272(2): 549-564 (2019) - [j17]Barrett W. Thomas, Tobia Calogiuri, Mike Hewitt:
An exact bidirectional A⋆ approach for solving resource-constrained shortest path problems. Networks 73(2): 187-205 (2019) - [j16]Mike Hewitt:
Enhanced Dynamic Discretization Discovery for the Continuous Time Load Plan Design Problem. Transp. Sci. 53(6): 1731-1750 (2019) - 2018
- [j15]Teodor Gabriel Crainic, Mike Hewitt, Michel Toulouse, Duc Minh Vu:
Scheduled service network design with resource acquisition and management. EURO J. Transp. Logist. 7(3): 277-309 (2018) - [j14]Huan Jin, Mike Hewitt, Barrett W. Thomas:
Workforce grouping and assignment with learning-by-doing and knowledge transfer. Int. J. Prod. Res. 56(14): 4968-4982 (2018) - [j13]Mike Hewitt, Barrett W. Thomas:
Special Issue on Uncertainty in Logistics and Transportation Systems. Transp. Sci. 52(1): 1-2 (2018) - 2017
- [j12]Xi Chen, Barrett W. Thomas, Mike Hewitt:
Multi-period technician scheduling with experience-based service times and stochastic customers. Comput. Oper. Res. 82: 1-14 (2017) - [j11]Silviya Valeva, Mike Hewitt, Barrett W. Thomas:
A matheuristic for workforce planning with employee learning and stochastic demand. Int. J. Prod. Res. 55(24): 7380-7397 (2017) - [j10]Natashia Boland, Mike Hewitt, Luke Marshall, Martin W. P. Savelsbergh:
The Continuous-Time Service Network Design Problem. Oper. Res. 65(5): 1303-1321 (2017) - [c3]Natashia Boland, Mike Hewitt, Duc Minh Vu, Martin W. P. Savelsbergh:
Solving the Traveling Salesman Problem with Time Windows Through Dynamically Generated Time-Expanded Networks. CPAIOR 2017: 254-262 - 2016
- [j9]Mike Hewitt, Maciek Nowak, Nisha Nataraj:
Planning Strategies for Home Health Care Delivery. Asia Pac. J. Oper. Res. 33(5): 1650041:1-1650041:26 (2016) - [j8]Huan Jin, Barrett W. Thomas, Mike Hewitt:
Integer programming techniques for makespan minimizing workforce assignment models that recognize human learning. Comput. Ind. Eng. 97: 202-211 (2016) - [j7]Teodor Gabriel Crainic, Mike Hewitt, Michel Toulouse, Duc Minh Vu:
Service Network Design with Resource Constraints. Transp. Sci. 50(4): 1380-1393 (2016) - 2015
- [j6]Mike Hewitt, Austin Chacosky, Scott E. Grasman, Barrett W. Thomas:
Integer programming techniques for solving non-linear workforce planning models with learning. Eur. J. Oper. Res. 242(3): 942-950 (2015) - [j5]Mike Hewitt, Maciek Nowak, Leo Gala:
Consolidating home meal delivery with limited operational disruption. Eur. J. Oper. Res. 243(1): 281-291 (2015) - 2014
- [j4]Teodor Gabriel Crainic, Mike Hewitt, Walter Rei:
Scenario grouping in a progressive hedging-based meta-heuristic for stochastic network design. Comput. Oper. Res. 43: 90-99 (2014) - 2013
- [j3]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh, Jin-Hwa Song:
A branch-and-price guided search approach to maritime inventory routing. Comput. Oper. Res. 40(5): 1410-1419 (2013) - [j2]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search for Integer Programs with an Application to the Multicommodity Fixed-Charge Network Flow Problem. INFORMS J. Comput. 25(2): 302-316 (2013) - 2012
- [c2]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Branch-and-Price Guided Search - (Extended Abstract). ISCO 2012: 15-18 - 2010
- [j1]Mike Hewitt, George L. Nemhauser, Martin W. P. Savelsbergh:
Combining Exact and Heuristic Approaches for the Capacitated Fixed-Charge Network Flow Problem. INFORMS J. Comput. 22(2): 314-325 (2010)
2000 – 2009
- 2009
- [i1]George L. Nemhauser, Mike Hewitt, Martin W. P. Savelsbergh:
Using Branch-and-Price to Find High Quality Solutions Quickly. Models and Algorithms for Optimization in Logistics 2009
1980 – 1989
- 1986
- [c1]Barbara Hayes-Roth, Bruce G. Buchanan, Olivier Lichtarge, Mike Hewitt, Russ B. Altman, James F. Brinkley, Craig Cornelius, Bruce S. Duncan, Oleg Jardetzky:
PROTEAN: Deriving Protein Structure from Constraints. AAAI 1986: 904-909
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 21:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
