default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDThomas Kalinowski
- > Home > Persons > Thomas Kalinowski
Publications
- 2017
[j24]Natashia Boland
, Thomas Kalinowski, Fabian Rigterink:
A polynomially solvable case of the pooling problem. J. Glob. Optim. 67(3): 621-630 (2017)- [j23]Natashia Boland, Santanu S. Dey, Thomas Kalinowski, Marco Molinaro, Fabian Rigterink:
Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions. Math. Program. 162(1-2): 523-535 (2017) - 2016
- [j20]Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. J. Comb. Optim. 32(3): 885-905 (2016) - [j19]Natashia Boland, Thomas Kalinowski, Fabian Rigterink:
New multi-commodity flow formulations for the pooling problem. J. Glob. Optim. 66(4): 669-710 (2016) - [j18]Natashia Boland, Irina Dumitrescu, Gary Froyland, Thomas Kalinowski:
Minimum cardinality non-anticipativity constraint sets for multistage stochastic programming. Math. Program. 157(1): 69-93 (2016) - 2015
- [j16]Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling network maintenance jobs with release dates and deadlines to maximize total flow over time: Bounds and solution strategies. Comput. Oper. Res. 64: 113-129 (2015) - [i9]Natashia Boland, Thomas Kalinowski, Fabian Rigterink:
A polynomially solvable case of the pooling problem. CoRR abs/1508.03181 (2015) - 2014
- [j14]Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng:
Scheduling arc maintenance jobs in a network to maximize total flow over time. Discret. Appl. Math. 163: 34-52 (2014) - [j12]Natashia Boland, Reena Kapoor, Simranjit Kaur, Thomas Kalinowski:
Scheduling unit time arc shutdowns to maximize network flow over time: Complexity results. Networks 63(2): 196-202 (2014) - 2013
- [j10]Natashia Boland, Thomas Kalinowski, Hamish Waterer, Lanbo Zheng:
Mixed integer programming based maintenance scheduling for the Hunter Valley coal chain. J. Sched. 16(6): 649-659 (2013) - [i3]Natashia Boland, Thomas Kalinowski, Reena Kapoor, Simranjit Kaur:
Scheduling unit processing time arc shutdown jobs to maximize network flow over time: complexity results. CoRR abs/1306.4917 (2013) - [i2]Natashia Boland, Thomas Kalinowski, Simranjit Kaur:
Scheduling arc shut downs in a network to maximize flow over time with a bounded number of jobs per time period. CoRR abs/1307.3650 (2013)
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-08-23 19:19 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:
