On the complexity of postoptimality analysis of 0/1 programs

Discrete Applied Mathematics

Volumn 91, Issue 1-3, 1999, Pages 251-263

  Van Hoesel, Stan ^a   Wagelmans, Albert ^b  

^a MAASTRICHT UNIVERSITY   (Netherlands)

^b ERASMUS UNIVERSITY ROTTERDAM   (Netherlands)

Author keywords

Computational complexity; Postoptimality analysis

Indexed keywords

EID: 0346133370     PISSN: 0166218X     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0166-218X(98)00151-6     Document Type: Article

References (12)

1. N. Chakravarti, A.P.M. Wagelmans, Calculation of stability radii for combinatorial optimization problems, Oper. Res. Lett. 23 (1999) 1-7.
2. T. Gal, Postoptimal Analysis, Parametric Programming and Related Topics, McGraw-Hill. New York, 1979.
3. E.N. Gordeev, V.K. Leontev, I.Kh. Sigal, Computational algorithms for finding the radius of stability in selection problems, USSR Comput. Math. Math. Phys. 23 (1983) 973-979.
4. H. Greenberg, An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization, in: D.L. Woodruff (Ed.), Advances in Computational and Stochastic Optimization, Logic Programming, and Heuristic Search, Kluwer Academic Publishers, Dordrecht, 1998, pp. 97-148.
5. D.S. Johnson, C.H. Papadimitriou, Computational complexity, in: E.L. Lawler, J.K. Lenstra, A.H.G. Rinnooy Kan, D.B. Shmoys (Eds.), The Traveling Salesman Problem, Wiley, New York. 1985, pp. 37-85.
6. S.A. Kravchenko, Yu.N. Sotskov, F. Werner, Optimal schedules with infinitely large stability radius, Optimization 33 (1995) 271-280.
7. M. Libura, E.S. Van der Poort, G. Sierksma, J.A.A. Van der Veen, Stability aspects of the traveling salesman problem based on the k-best solutions, Discrete Appl. Math. (1999), to appear.
8. R. Ramaswamy, N. Chakravarti, Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems, Working Paper WPS-247/95. Indian Institute of Management, Calcutta, India, 1995, pp. 34.
9. Yu.N. Sotskov, The stability of the approximate boolean minimization of a linear form, USSR Comput. Math. Math. Phys. 33 (1993) 699-707.
10. Yu.N. Sotskov, V.K. Leontev, E.N. Gordeev, Some concepts of stability analysis in combinatorial optimization, Discrete Appl. Math. 58 (1995) 169-190.
11. Yu.N. Sotskov, A.P.M. Wagelmans, F. Werner, On the calculation of the stability radius of an optimal or an approximate schedule, Ann. Oper. Res. 83 (1998) 213-252.
12. R.E. Wendell, The tolerance approach to sensitivity analysis in linear programming, Management Sci. 31 (1985) 564-578.