Abstract
Some remarks about the Kasperski and Zielinski approximation algorithm for a class of interval data minmax regret combinatorial optimization problems (Algorithm K&Z) are presented. These remarks help to give a better understanding of both the design of the algorithm and its possible applications.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
I. Averbakh, On the complexity of a class of combinatorial optimization problems with uncertainty, Mathematical Programming, Ser.A 90 (2001) 263–272.
I. Averbakh and Lebedev, Interval data min-max regret network optimization problems, Discrete Applied Mathematics 138 (2004) 289–301.
E. Conde and A. Candia, Minmax regret spanning arborescences under uncertain costs, European Journal of Operational Research 182 (2007) 561–577.
D. Eppstein, Finding the k Shortest Paths, SIAM J. Comput. 28(2) (1998) 652–673.
A. Kasperski and P. Zielinski, An approximation algorithm for interval data minmax regret combinatorial optimization problems, Information Processing Letters 97 (2006) 177–180.
P. Kouvelis and G. Yu, Robust discrete optimization and Its Applications, Kluwer Academic Publishers, Boston, 1997.
R. Montemanni, A Benders decomposition approach for the robust spanning tree problem with interval data, European Journal of Operational Research 174(3) (2006) 1479–1490.
R. Montemanni, J. Barta and L. M. Gambardella, Heuristic and preprocessing techniques for the robust traveling salesman problem with interval data, Technical Report IDSIA-01-06.
H. Yaman, O.E. Karasan and M.C. Pinar, The robust spanning tree problem with interval data, Operations Research Letters 29 (2001) 31–40.
P. Zielinski, The computational complexity of the relative robust shortest path probem with interval data, European Journal of Operational Research 158 (2004) 570–576.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Candia-Véjar, A., Álvarez-Miranda, E. (2008). On a Class of Interval Data Minmax Regret CO Problems. In: Kalcsics, J., Nickel, S. (eds) Operations Research Proceedings 2007. Operations Research Proceedings, vol 2007. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77903-2_19
Download citation
DOI: https://doi.org/10.1007/978-3-540-77903-2_19
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77902-5
Online ISBN: 978-3-540-77903-2
eBook Packages: Business and EconomicsBusiness and Management (R0)