![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Michal Kaut
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j15]Michal Kaut:
Handling of long-term storage in multi-horizon stochastic programs. Comput. Manag. Sci. 21(1): 27 (2024) - 2021
- [j14]Michal Kaut
:
Scenario generation by selection from historical data. Comput. Manag. Sci. 18(3): 411-429 (2021)
2010 – 2019
- 2019
- [j13]Zhaoxia Guo
, Stein W. Wallace
, Michal Kaut
:
Vehicle Routing with Space- and Time-Correlated Stochastic Travel Times: Evaluating the Objective Function. INFORMS J. Comput. 31(4): 654-670 (2019) - 2017
- [j12]Hajnalka Vaagen, Michal Kaut
, Stein W. Wallace:
The impact of design uncertainty in engineer-to-order project planning. Eur. J. Oper. Res. 261(3): 1098-1109 (2017) - 2015
- [j11]Michal Kaut
:
Erratum to: A copula-based heuristic for scenario generation. Comput. Manag. Sci. 12(2): 341-343 (2015) - [c1]Hajnalka Vaagen, Michal Kaut
:
A Mockup Stochastic Program to Study the Impact of Design Uncertainty on ETO Shipbuilding Planning. APMS (2) 2015: 167-174 - 2014
- [j10]Michal Kaut
, Kjetil T. Midthun, Adrian S. Werner
, Asgeir Tomasgard
, Lars Hellemo
, Marte Fodstad:
Multi-horizon stochastic programming. Comput. Manag. Sci. 11(1-2): 179-193 (2014) - [j9]Michal Kaut
:
A copula-based heuristic for scenario generation. Comput. Manag. Sci. 11(4): 503-516 (2014) - [j8]Michal Kaut
, Arnt-Gunnar Lium:
Scenario generation with distribution functions and correlations. Kybernetika 50(6): 1049-1064 (2014) - 2012
- [j7]Biju Kr. Thapalia, Stein W. Wallace, Michal Kaut
, Teodor Gabriel Crainic
:
Single source single-commodity stochastic network design. Comput. Manag. Sci. 9(1): 139-160 (2012) - [j6]Biju Kr. Thapalia, Teodor Gabriel Crainic
, Michal Kaut
, Stein W. Wallace:
Single-commodity network design with random edge capacities. Eur. J. Oper. Res. 220(2): 394-403 (2012) - 2011
- [j5]Michal Kaut
, Stein W. Wallace:
Shape-based scenario generation using copulas. Comput. Manag. Sci. 8(1-2): 181-199 (2011) - [j4]Biju Kr. Thapalia, Teodor Gabriel Crainic
, Michal Kaut
, Stein W. Wallace:
Single-Commodity Network Design with Stochastic Demand and Multiple Sources and Sinks. INFOR Inf. Syst. Oper. Res. 49(3): 193-211 (2011)
2000 – 2009
- 2009
- [j3]Francesca Maggioni
, Michal Kaut
, Luca Bertazzi:
Stochastic optimization models for a single-sink transportation problem. Comput. Manag. Sci. 6(2): 251-267 (2009) - [j2]Biju Kr. Thapalia, Stein W. Wallace, Michal Kaut
:
Using inventory to handle risks in the supply of oil to Nepal. Int. J. Bus. Perform. Supply Chain Model. 1(1): 41-60 (2009) - 2003
- [j1]Kjetil Høyland, Michal Kaut
, Stein W. Wallace:
A Heuristic for Moment-Matching Scenario Generation. Comput. Optim. Appl. 24(2-3): 169-185 (2003)
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-06-10 20:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint