default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 107 matches
- 2024
- Romain Guillaume, Adam Kasperski, Pawel Zielinski:
A framework of distributionally robust possibilistic optimization. Fuzzy Optim. Decis. Mak. 23(2): 253-278 (2024) - Adam Kasperski, Pawel Zielinski:
Recoverable Possibilistic Linear Programming. FUZZ 2024: 1-8 - Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Recoverable robust shortest path problem under interval uncertainty representations. CoRR abs/2401.05715 (2024) - Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Computational Complexity of the Recoverable Robust Shortest Path Problem with Discrete Recourse. CoRR abs/2403.20000 (2024) - 2023
- Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Distributionally robust possibilistic optimization problems. Fuzzy Sets Syst. 454: 56-73 (2023) - Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with belief functions. Int. J. Approx. Reason. 159: 108941 (2023) - Marc Goerigk, Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with belief functions. CoRR abs/2303.05067 (2023) - Marcel Jackiewicz, Adam Kasperski, Pawel Zielinski:
Solving the recoverable robust shortest path problem in DAGs. CoRR abs/2309.02816 (2023) - 2022
- Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty. J. Comb. Optim. 43(3): 497-527 (2022) - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust inventory problem with budgeted cumulative demand uncertainty. Optim. Lett. 16(9): 2543-2556 (2022) - Adam Kasperski, Pawel Zielinski:
Solving Robust Production Planning Problem with Interval Budgeted Uncertainty in Cumulative Demands. Vietnam. J. Comput. Sci. 9(3): 285-296 (2022) - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
A framework of distributionally robust possibilistic optimization. CoRR abs/2210.15193 (2022) - 2021
- Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Combinatorial two-stage minmax regret problems under interval uncertainty. Ann. Oper. Res. 300(1): 23-50 (2021) - Adam Kasperski, Pawel Zielinski:
Soft robust solutions to possibilistic optimization problems. Fuzzy Sets Syst. 422: 130-148 (2021) - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Distributionally Robust Optimization in Possibilistic Setting. FUZZ-IEEE 2021: 1-6 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust optimization with scenarios using random fuzzy sets. FUZZ-IEEE 2021: 1-6 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust Possibilistic Optimization with Copula Function. FUZZ-IEEE 2021: 1-6 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust Optimization with Scenarios Using Belief Functions. OR 2021: 114-119 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Distributionally robust possibilistic optimization problems. CoRR abs/2111.14071 (2021) - 2020
- André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Approximating combinatorial optimization problems with the ordered weighted averaging criterion. Eur. J. Oper. Res. 286(3): 828-838 (2020) - Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Two-stage combinatorial optimization problems under risk. Theor. Comput. Sci. 804: 29-45 (2020) - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust Possibilistic Production Planning Under Budgeted Demand Uncertainty. FUZZ-IEEE 2020: 1-8 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Softening the Robustness of Optimization Problems: A New Budgeted Uncertainty Approach. IPMU (1) 2020: 187-200 - Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Combinatorial two-stage minmax regret problems under interval uncertainty. CoRR abs/2005.10610 (2020) - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Robust production planning with budgeted cumulative demand uncertainty. CoRR abs/2009.05736 (2020) - 2019
- Mikita Hradovich, Adam Kasperski, Pawel Zielinski:
Robust recoverable 0-1 optimization problems under polyhedral uncertainty. Eur. J. Oper. Res. 278(1): 136-148 (2019) - Adam Kasperski, Pawel Zielinski:
Risk-averse single machine scheduling: complexity and approximation. J. Sched. 22(5): 567-580 (2019) - Adam Kasperski, Pawel Zielinski:
A (Soft) Robustness for Possibilistic Optimization Problems. FUZZ-IEEE 2019: 1-6 - Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Solving Robust Two-Stage Combinatorial Optimization Problems Under Convex Uncertainty. OR 2019: 423-429 - Romain Guillaume, Adam Kasperski, Pawel Zielinski:
Production Planning Under Demand Uncertainty: A Budgeted Uncertainty Approach. OR 2019: 431-437
skipping 77 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-10-06 11:33 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint