Research output: Contribution in Book/Report/Proceedings - With ISBN/ISSN › Conference contribution/Paper › peer-review
| Publication date | 2011 |
|---|---|
| Host publication | Theory and Practice of Algorithms in (Computer) Systems |
| Editors | Alberto Marchetti-Spaccamela, Michael Segal |
| Place of Publication | Berlin |
| Publisher | Springer |
| Pages | 139-150 |
| Number of pages | 12 |
| ISBN (electronic) | 9783642197543 |
| ISBN (print) | 9783642197536 |
| <mark>Original language</mark> | English |
| Event | 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011 - Rome, Italy Duration: 18/04/2011 → 20/04/2011 |
| Conference | 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 18/04/11 → 20/04/11 |
| Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
|---|---|
| Publisher | Springer |
| Volume | 6595 |
| ISSN (Print) | 0302-9743 |
| ISSN (electronic) | 1611-3349 |
| Conference | 1st International ICST Conference on Theory and Practice of Algorithms in (Computer) Systems, TAPAS 2011 |
|---|---|
| Country/Territory | Italy |
| City | Rome |
| Period | 18/04/11 → 20/04/11 |
Finding robust solutions of an optimization problem is an important issue in practice. The established concept of Ben-Tal et al. [2] requires that a robust solution is feasible for all possible scenarios. However, this concept is very conservative and hence may lead to solutions with a bad objective value and is in many cases hard to solve. Thus it is not suitable for most practical applications. In this paper we suggest an algorithm for calculating robust solutions that is easy to implement and not as conservative as the strict robustness approach. We show some theoretical properties of our approach and evaluate it using linear programming problems from NetLib.