Min-max and two-stage possibilistic combinatorial optimization problems

2011 ◽  
Author(s):  
Adam Kasperski ◽  
Pawel Zielinski
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Two Stage ◽  
Combinatorial Optimization Problems

scholarly journals Two-stage combinatorial optimization problems under risk

2020 ◽  
Vol 804 ◽  
pp. 29-45 ◽  
Author(s):  
Marc Goerigk ◽  
Adam Kasperski ◽  
Paweł Zieliński
Keyword(s):  
Combinatorial Optimization ◽  
Optimization Problems ◽  
Two Stage ◽  
Combinatorial Optimization Problems

scholarly journals Robust two-stage combinatorial optimization problems under convex second-stage cost uncertainty

2021 ◽  
Author(s):  
Marc Goerigk ◽  
Adam Kasperski ◽  
Paweł Zieliński
Keyword(s):  
Combinatorial Optimization ◽  
Approximation Algorithms ◽  
Network Optimization ◽  
Optimization Problems ◽  
Two Stage ◽  
Shortest Path Problems ◽  
Combinatorial Optimization Problems ◽  
Second Stage ◽  
Uncertainty Set ◽  
Basic Network

AbstractIn this paper a class of robust two-stage combinatorial optimization problems is discussed. It is assumed that the uncertain second-stage costs are specified in the form of a convex uncertainty set, in particular polyhedral or ellipsoidal ones. It is shown that the robust two-stage versions of basic network optimization and selection problems are NP-hard, even in a very restrictive cases. Some exact and approximation algorithms for the general problem are constructed. Polynomial and approximation algorithms for the robust two-stage versions of basic problems, such as the selection and shortest path problems, are also provided.

Sign in / Sign up

Export Citation Format

Share Document