Optimality conditions and sensitivity analysis for combinatorial optimization problems

Control and Cybernetics

Volumn 25, Issue 6, 1996, Pages 1164-1180

  Libura, Marek ^a  

^a SYSTEMS RESEARCH INSTITUTE   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

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

References (21)

1. CROWDER, H., JOHNSON, E.L., PADBERG, M. (1983) Solving large-scale zero-one linear programming problems. Operations Research, 31, 803-834.
2. FIACCO A. V. (1983) Introduction to Sensitivity and Stability Analysis in Non-linear Programming. Academic Press, New York, London.
3. GAL T. (1979) Postoptimal Analyses, Parametric Programming, and Related Topics. McGraw-Hill, New York.
4. GARFINKEL, R.S., NEMHAUSER, G.L. (1972) Integer Programming. Wiley, New York.
5. GEOFFRION, A.M., NAUSS, R. (1977) Parametric and postoptimality analysis in integer programming. Management Science, 23, 453-466.
6. LAWLER, E.L., LENSTRA, J.K., RINNOY KAN, A.G., SHMOYS, D. (1985) The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. Wiley.
7. LAWLER, E.L. (1976) Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston, New York.
8. LEONTEV, V.K. (1979) Stability of discrete linear problems. (in Russian) Problemy Kibiernietiki 35, 169-184.
9. LIBURA, M. (1977A) Sensitivity analysis in integer programming. (in Polish) Archiwum Automatyki i Telemechaniki, XXII, 299-311.
10. LIBURA, M. (1977B) Sensitivity analysis for integer knapsack problem. (in Polish) Archiwum Automatyki i Telemechaniki, XXII, 313-322.
11. LIBURA, M. (1984) Integer programming duality and its applications in sensitivity analysis and approximate algorithms. (in Polish) Archiwum Automatyki i Telemechaniki, XXIX, 1-2, 75-92.
12. LIBURA, M. (1991A) Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics, 30, 197-211.
13. LIBURA, M. (1991B) Sensitivity analysis for minimum weight base of matroid. Control and Cybernetics, 20, 7-24.
14. LIBURA, M. (1993) Sensitivity Analysis for Solutions of Discrete Optimization Problems, (in Polish) Synpress, Warszawa.
15. LIBURA, M. VAN DER POORT, E.S., SIERKSMA, G., VAN DER VEEN, J.A.A. (1995) Sensitivity analysis and k-best solutions for the traveling salesman problem. Working Paper WP-1-1995, IBS PAN.
16. PIPER, C.J., ZOLTNERS, A.A. (1976) Some easy postoptimality analysis for zero-one programming. Management Science, 22, 759-765.
17. SCHRIJVER A. (1986) Theory of Linear and Integer Programming. Wiley, Chichester.
18. TIND, J., WOLSEY, L.A. (1981) An elementary survey of general duality theory in mathematical programming. Mathematical Programming, 21, 241-261.
19. WARD, J.E., WENDELL, R.E. (1990) Approaches to sensitivity analysis in linear programming. Annals of Operations Research, 27, 3-38.
20. WELSH, D.J.A. (1976) Matroid Theory. Academic Press, London, New York, San Francisco.
21. WOLSEY L.A. (1981) Integer programming duality: Price functions and sensitivity analysis. Mathematical Programming, 20, 173-195.