default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAndré B. Chassein
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j19]André B. Chassein, Marc Goerigk
:
On the complexity of min-max-min robustness with two alternatives and budgeted uncertainty. Discret. Appl. Math. 296: 141-163 (2021)- 2020
- [j18]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)
2010 – 2019
- 2019
- [j17]André B. Chassein, Anika Kinscherff:
Complexity of strict robust integer minimum cost flow problems: An overview and further results. Comput. Oper. Res. 104: 228-238 (2019) - [j16]André B. Chassein, Trivikram Dokka, Marc Goerigk:
Algorithms and uncertainty sets for data-driven robust shortest path problems. Eur. J. Oper. Res. 274(2): 671-686 (2019) - [j15]André B. Chassein, Marc Goerigk, Jannis Kurtz, Michael Poss:
Faster algorithms for min-max-min robustness for combinatorial problems with budgeted uncertainty. Eur. J. Oper. Res. 279(2): 308-319 (2019) - [j14]André B. Chassein, Marc Goerigk:
On the complexity of robust geometric programming with polyhedral uncertainty. Oper. Res. Lett. 47(1): 21-24 (2019) - 2018
- [j13]André B. Chassein, Marc Goerigk:
Variable-sized uncertainty and inverse problems in robust optimization. Eur. J. Oper. Res. 264(1): 17-28 (2018) - [j12]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
On recoverable and two-stage robust selection problems with budgeted uncertainty. Eur. J. Oper. Res. 265(2): 423-436 (2018) - [j11]Borzou Rostami, André B. Chassein, Michael Hopf, Davide Frey, Christoph Buchheim, Federico Malucelli, Marc Goerigk:
The quadratic shortest path problem: complexity, approximability, and solution methods. Eur. J. Oper. Res. 268(2): 473-485 (2018) - [j10]André B. Chassein, Marc Goerigk:
Compromise solutions for robust combinatorial optimization with variable-sized uncertainty. Eur. J. Oper. Res. 269(2): 544-555 (2018) - [j9]André B. Chassein, Marc Goerigk:
On scenario aggregation to approximate robust combinatorial optimization problems. Optim. Lett. 12(7): 1523-1533 (2018) - [i3]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
Approximating multiobjective combinatorial optimization problems with the OWA criterion. CoRR abs/1804.03594 (2018) - 2017
- [j8]André B. Chassein, Marc Goerigk:
Minmax regret combinatorial optimization problems with ellipsoidal uncertainty sets. Eur. J. Oper. Res. 258(1): 58-69 (2017) - [i2]André B. Chassein, Marc Goerigk, Adam Kasperski, Pawel Zielinski:
On Recoverable and Two-Stage Robust Selection Problems with Budgeted Uncertainty. CoRR abs/1701.06064 (2017) - 2016
- [j7]André B. Chassein, Marc Goerigk:
A bicriteria approach to robust optimization. Comput. Oper. Res. 66: 181-189 (2016) - [j6]André B. Chassein, Sven O. Krumke, Clemens Thielen:
Capacitated network design games with weighted players. Networks 68(2): 141-158 (2016) - [j5]André B. Chassein, Marc Goerigk:
On the recoverable robust traveling salesman problem. Optim. Lett. 10(7): 1479-1492 (2016) - [i1]Marc Goerigk, André B. Chassein:
On Scenario Aggregation to Approximate Robust Optimization Problems. CoRR abs/1611.09754 (2016) - 2015
- [j4]Kien Trung Nguyen, André B. Chassein:
Inverse eccentric vertex problem on networks. Central Eur. J. Oper. Res. 23(3): 687-698 (2015) - [j3]André B. Chassein, Marc Goerigk:
A new bound for the midpoint solution in minmax regret optimization with an application to the robust shortest path problem. Eur. J. Oper. Res. 244(3): 739-747 (2015) - [j2]Kien Trung Nguyen, André B. Chassein:
The inverse convex ordered 1-median problem on trees under Chebyshev norm and Hamming distance. Eur. J. Oper. Res. 247(3): 774-781 (2015) - [j1]André B. Chassein, Marc Goerigk:
Alternative formulations for the ordered weighted averaging objective. Inf. Process. Lett. 115(6-8): 604-608 (2015)
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 2025-01-21 00:24 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:
