Recoverable Robust Combinatorial Optimization Problems

Adam Kasperski, Adam Kurpisz (adam.kurpisz@pwr.wroc.pl) and Paweł Zieliński (pawel.zielinski@pwr.wroc.pl)
Additional contact information
Adam Kurpisz: Wrocław University of Technology
Paweł Zieliński: Wrocław University of Technology

A chapter in Operations Research Proceedings 2012, 2014, pp 147-153 from Springer

Abstract: Abstract This paper deals with two Recoverable Robust (RR) models for combinatorial optimization problems with uncertain costs. These models were originally proposed by Büsing (2012) for the shortest path problem with uncertain costs. In this paper, we generalize the RR models to a class of combinatorial optimization problems with uncertain costs and provide new positive and negative complexity results in this area.

Keywords: Feasible Solution; Combinatorial Optimization Problem; Short Path Problem; Uncertainty Representation; Span Tree Problem (search for similar items in EconPapers)
Date: 2014
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:oprchp:978-3-319-00795-3_22

Ordering information: This item can be ordered from
http://www.springer.com/9783319007953

DOI: 10.1007/978-3-319-00795-3_22

Access Statistics for this chapter

More chapters in Operations Research Proceedings from Springer
Bibliographic data for series maintained by Sonal Shukla (sonal.shukla@springer.com) and Springer Nature Abstracting and Indexing (indexing@springernature.com).