default search action
Michael A. Forbes 0002
Person information
- affiliation (PhD): University of Queensland, School of Mechanical and Mining Engineering, Brisbane, QLD, Australia
Other persons with the same name
- Michael A. Forbes 0001 — University of Illinois at Urbana-Champaign, Department of Computer Science, Champaign, IL, USA (and 3 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j12]Michael A. Forbes
, Mitchell G. Harris
Combining optimisation and simulation using logic-based Benders decomposition. Eur. J. Oper. Res. 312(3): 840-854 (2024) - [j11]Yannik Rist
Benders Decomposition with Delayed Disaggregation for the Active Passive Vehicle Routing Problem. Eur. J. Oper. Res. 318(3): 836-850 (2024) - 2023
- [j10]Mitchell G. Harris
Logic-based benders decomposition for wildfire suppression. Comput. Oper. Res. 160: 106392 (2023) - [j9]Mitchell G. Harris
The Snake Eggs Puzzle: Preparing Students for Benders Decomposition. INFORMS Trans. Educ. 23(3): 210-217 (2023) - 2022
- [j8]Yannik Rist
A column generation and Combinatorial Benders Decomposition algorithm for the Selective Dial-A-Ride-Problem. Comput. Oper. Res. 140: 105649 (2022) - 2021
- [j7]Rick Jeuken, Michael A. Forbes, Michael Kearney:
Optimal blending strategies for coking coal using chance constraints. J. Oper. Res. Soc. 72(12): 2690-2703 (2021) - [j6]Yannik Rist
A New Formulation for the Dial-a-Ride Problem. Transp. Sci. 55(5): 1113-1135 (2021)
2010 – 2019
- 2019
- [j5]Robin H. Pearce, Michael A. Forbes:
Disaggregated benders decomposition for solving a network maintenance scheduling problem. J. Oper. Res. Soc. 70(6): 941-953 (2019) - [j4]Ali Mehsin Alyasiry
An Exact Algorithm for the Pickup and Delivery Problem with Time Windows and Last-in-First-out Loading. Transp. Sci. 53(6): 1695-1705 (2019) - 2018
- [j3]Robin H. Pearce
Disaggregated Benders decomposition and branch-and-cut for solving the budget-constrained dynamic uncapacitated facility location and network design problem. Eur. J. Oper. Res. 270(1): 78-88 (2018) - [j2]Haoquan Liu
Monte-Carlo Tree Search in Dragline Operation Planning. IEEE Robotics Autom. Lett. 3(1): 419-425 (2018) - 2017
- [j1]Robin H. Pearce, Michael A. Forbes:
Puzzle - The Fillomino Puzzle. INFORMS Trans. Educ. 17(2): 85-89 (2017)
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-12-12 20:57 CET 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: