default search action
Hamish Waterer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
- [j16]Natashia Boland, Riley Clement, Hamish Waterer
:
Corrigendum to "A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems, " INFORMS Journal on Computing 28(1): 14-30, 2016. INFORMS J. Comput. 33(2): 835 (2021) - 2020
- [j15]Thomas Kalinowski
Scheduling of maintenance windows in a mining supply chain rail network. Comput. Oper. Res. 115: 104670 (2020) - [j14]Akshay Gupte
Extended formulations for convex hulls of some bilinear functions. Discret. Optim. 36: 100569 (2020)
2010 – 2019
- 2019
- [i2]Saman Eskandarzadeh, Thomas Kalinowski, Hamish Waterer:
Maintenance scheduling in a railway corricdor. CoRR abs/1910.10348 (2019) - 2018
- [j13]Tomas Lidén
Resource considerations for integrated planning of railway traffic and maintenance windows. J. Rail Transp. Plan. Manag. 8(1): 1-15 (2018) - [i1]Thomas Kalinowski, Tomas Lidén, Hamish Waterer:
Tight MIP formulations for bounded length cyclic sequences. CoRR abs/1809.01773 (2018) - 2016
- [j12]Natashia Boland
A Bucket Indexed Formulation for Nonpreemptive Single Machine Scheduling Problems. INFORMS J. Comput. 28(1): 14-30 (2016) - 2015
- [j11]Antony E. Phillips
Integer programming methods for large-scale practical classroom assignment problems. Comput. Oper. Res. 53: 42-53 (2015) - [j10]Natashia Boland
A decision support tool for generating shipping data for the Hunter Valley coal chain. Comput. Oper. Res. 53: 54-67 (2015) - [j9]Martin W. P. Savelsbergh, Hamish Waterer, Matthew Dall, Chad Moffiet:
Possession assessment and capacity evaluation of the Central Queensland Coal Network. EURO J. Transp. Logist. 4(1): 139-173 (2015) - 2014
- [j8]Natashia Boland
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163: 34-52 (2014) - 2013
- [j7]Kerem Akartunali
Airline planning benchmark problems - Part I: : Characterising networks and demand using limited data. Comput. Oper. Res. 40(3): 775-792 (2013) - [j6]Kerem Akartunali
Airline planning benchmark problems - Part II: Passenger groups, utility and demand allocation. Comput. Oper. Res. 40(3): 793-804 (2013) - [j5]Natashia Boland
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16(6): 649-659 (2013) - 2012
- [j4]Olivia J. Smith
Solving shortest path problems with a weight constraint and replenishment arcs. Comput. Oper. Res. 39(5): 964-984 (2012)
2000 – 2009
- 2007
- [j3]Hamish Waterer:
Lot sizing with inventory gains. Oper. Res. Lett. 35(6): 759-766 (2007) - 2002
- [j2]Hamish Waterer, Ellis L. Johnson, Paolo Nobili
The relation of time indexed formulations of single machine scheduling problems to the node packing problem. Math. Program. 93(3): 477-494 (2002) - 2000
- [j1]Andrew B. Philpott
Hydro-electric unit commitment subject to uncertain demand. Eur. J. Oper. Res. 125(2): 410-424 (2000)
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-04-24 23:02 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: