Quality of solutions for perturbed combinatorial optimization problems

Control and Cybernetics

Volumn 29, Issue 1, 2000, Pages 198-219

  Libura, M ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

Accuracy function; Accuracy radius; Combinatorial optimization; Sensitivity analysis; Stability function; Stability radius

Indexed keywords

EID: 0346312254     PISSN: 03248569     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (16)

1. GREENBERG, H. (1998) An annotated bibliography for post-solution analysis in mixed integer and combinatorial optimization. In: D. Woodruff (Ed.), Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search. Kluwer Academic Publishers, Dordrecht, 97-148.
2. HAMACHER, H.W. and QUEYRANNE, M. (1985/6) K best solutions to combinatorial optimization problems. Annals of Operations Research, 4, 123-143.
3. LABBÉ, M., THISSE, J.F. and WENDELL, R.E. (1991) Sensitivity analysis in minisum facility location problems. Operations Research, 39, 961-969.
4. LAWLER, E.L. (1972) A procedure for computing the K best solutions to discrete optimization problems and its applications to the shortest path problem. Management Science, 18, 401-407.
5. LIBURA, M. (1996) Optimality conditions and sensitivity analysis for combinatorial optimization problems. Control and Cybernetics, 25, 1165-1180.
6. LIBURA, M. (1999) On accuracy of solutions for combinatorial optimization problems with perturbed coefficients of the objective function. Annals of Operations Research, 86, 53-62.
7. LIBURA, M., VAN DER POORT, E.S., SIERKSMA, G. and VAN DER VEEN, J.A.A. (1998) Stability aspects of the traveling salesman problem based on k-best solutions. Discrete Applied Mathematics, 87, 159-185.
8. PIPER, C.J. and ZOLTNERS, A.A. (1976) Some easy postoptimality analysis for zero-one programming. Management Science, 22, 759-765.
9. RAMASWAMY, R. and CHAKRAVARTI, N. (1995) Complexity of determining exact tolerances for min-sum and min-max combinatorial optimization problems. Report No. WPS-247/95, Indian Institute of Management, Calcutta.
10. SOTSKOV, Y.N., LEONTEV, V.K. and GORDEEV, E.N. (1995) Some concepts of stability analysis in combinatorial optimization. Discrete Applied Mathematics, 58, 169-190.
11. SOTSKOV, Y.N., WAGELMANS, A.P.M. and WERNER, F. (1998) On the calculation of the stability radius of an optimal schedule. Annals of Operations Research, 83, 213-252.
12. VAN DER POORT, E.S., LIBURA, M., SIERKSMA, G. and VAN DER VEEN, J.A.A. (1999) Solving the k-best traveling salesman problem. Computers and Operations Research, 26, 409-425.
13. VAN HOESEL, S. and WAGELMANS, A. (1999) On the complexity of postoptimal analysis of 0/1 programs. Discrete Applied Mathematics, 91, 251-263.
14. WENDELL, R.E. (1982) A preview of a tolerance approach to sensitivity in linear programming. Discrete Mathematics, 38, 121-124.
15. WENDELL, R.E. (1984) Using bounds on the data in linear programming: The tolerance approach to sensitivity analysis. Mathematical Programming, 28, 304-322.
16. WILSON, G.R. and JAIN, H.K. (1988) An approach to postoptimality and sensitivity analysis of zero-one goal programs. Naval Research Logistics, 35, 73-84.