An Annotated Bibliography for Post-Solution Analysis in Mixed Integer Programming and Combinatorial Optimization

  • Harvey J. Greenberg
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 9)

Abstract

This annotated bibliography focuses on what has been published since the 1977 Geoffrion-Nauss survey. In addition to postoptimal sensitivity analysis, this survey includes debugging a run, such as when the integer program is unbounded, anomalous or infeasible.

Keywords

Span Tree Integer Program Stability Region Integer Linear Program Travel Salesman Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Agarwal, S., Mittal, A. K., and Sharma, P. (1984). Constrained optimum communication trees and sensitivity analysis. SIAM Journal on Computing, 13 (2): 315–328.CrossRefGoogle Scholar
  2. [2]
    Arsham, H. (1994). A solution algorithm with sensitivity analysis for optimal matchings and related problems. Congressus Numerantium, 102 (2): 193–230.Google Scholar
  3. [3]
    Bailey, M. G. and Gillett, B. E. (1980). Parametric integer programming analysis: A contraction approach. Journal of the Operational Research Society, 31 (3): 257–262.Google Scholar
  4. [4]
    Ball, M. O. and Taverna, R. (1985/6). Sensitivity analysis for the matching problem and its use in solving matching problems with a single side constraint. Annals of Operations Research, 4: 25–56.Google Scholar
  5. [5]
    Bank, B. (1980). Stability analysis in pure and mixed-integer linear programming. Number 23 in Lecture Notes in Control and Information Science, pages 148–153. Springer-Verlag, Berlin, Germany.Google Scholar
  6. [6]
    Bank, B. and Hansel, R. (1984). Stability of mixed-integer quadratic programming problems. Mathematical Programming Study, 21: 1–17.CrossRefGoogle Scholar
  7. [7]
    Bank, B. and Mandel, R. (1988). Parametric Integer Optimization. Mathematische Forschung, Band 39. Akademie–Verlag, Berlin, Germany. Note: this is sometimes cited as an article, but it is a monograph with ISBN=3–05–500398–5 and ISSN=0138–3019.Google Scholar
  8. [8]
    Blair, C. E. (1995). A closed-form representation of mixed-integer program value functions. Mathematical Programming, 71: 127–136.Google Scholar
  9. [9]
    Blair, C. E. (1996). Sensitivity analysis for knapsack problems: A negative result. Working paper number 96–0131, University of Illinois at Urbana-Champaign, College of Commerce and Business Administration, Office of Research, Champaign, IL. Note: to appear in Discrete Applied Mathematics.Google Scholar
  10. [10]
    Blair, C. E. (1997). Integer and mixed-integer programming In [44], chapter 3.Google Scholar
  11. [11]
    Blair, C. E. and Jeroslow, R. G. (1977). The value function of a mixed integer program: I. Discrete Mathematics, 19: 121–138.CrossRefGoogle Scholar
  12. [12]
    Blair, C. E. and Jeroslow, R. G. (1979). The value function of a mixed integer program: II. Discrete Mathematics, 25: 7–19.CrossRefGoogle Scholar
  13. [13]
    Blair, C. E. and Jeroslow, R. G. (1982). The value function of an integer program. Mathematical Programming, 23: 237–273.CrossRefGoogle Scholar
  14. [14]
    Blair, C. E. and Jeroslow, R. G. (1984). Constructive characterization of the value function of a mixed-integer program: I. Discrete Applied Mathematics, 9: 217–233.CrossRefGoogle Scholar
  15. [15]
    Blair, C. E. and Jeroslow, R. G. (1985). Constructive characterization of the value function of a mixed-integer program: II. Discrete Applied Mathematics, 10: 227–240.CrossRefGoogle Scholar
  16. [16]
    Blair, C. E. and Jeroslow, R. G. (1986). Computational complexity of some problems in parametric discrete programming I Mathematics of Operations Research, 11 (2): 241–260.CrossRefGoogle Scholar
  17. [17]
    Booth, H. and Westbrook, J. (1994). A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs. Algorithmica, 11: 341–352.CrossRefGoogle Scholar
  18. [18]
    Bräsel, H., Sotskov, Y. N., and Werner, F. (1996). Stability of a schedule minimizing mean flow time. Mathematical Computer Modelling, 24 (10): 39–53.CrossRefGoogle Scholar
  19. [19]
    Burkard, R. E. and Pferschy, U. (1995). The inverse-parametric knapsack problem. European Journal of Operational Research, 83 (2): 376–393.CrossRefGoogle Scholar
  20. [20]
    Byrd, R. H., Goldman, A. J., and Heller, M. (1987). Recognizing unbounded integer programs. Operations Research, 35 (1): 140–142.CrossRefGoogle Scholar
  21. [21]
    Carstensen, P. J. (1983). Complexity of some parametric integer and network programming problems. Mathematical Programming, 26 (1): 64–75.CrossRefGoogle Scholar
  22. [22]
    Chakravarti, N. and Wagelmans, A. P. M. (1997). Calculation of stability radii for combinatorial optimization problems. Report 9740/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.Google Scholar
  23. [23]
    Chern, M. S., Jan, R. H., and Chern, R. J. (1991). Parametric nonlinear integer programming- The right-hand side case. European Journal of Operational Research, 54 (2): 237–255.CrossRefGoogle Scholar
  24. [24]
    Chin, E and Houck, D. (1978). Algorithms for updating minimal spanning trees. Journal of Computer and Systems Sciences, 16: 333–344.CrossRefGoogle Scholar
  25. [25]
    Ciric, A. R. and Huchette, S. G. (1993). Multiobjective optimization approach to sensitivity analysis: Waste treatment costs in discrete process synthesis and optimization problems. Industrial & Engineering Chemistry Research, 32 (11): 2636–2646.CrossRefGoogle Scholar
  26. [26]
    Cook, W., Gerards, A. M. H., Schrijver, A., and Tardos, E. (1986). Sensitivity theorems in integer linear programming Mathematical Programming, 34 (3): 251–264.CrossRefGoogle Scholar
  27. [27]
    Cooper, M. W. (1981). Postoptimality analysis in non-linear integer program-ming Naval Research Logistics Quarterly, 28: 301–307.Google Scholar
  28. [28]
    Crema, A. (1995). Average shadow price in a mixed integer linear programming problem. European Journal of Operational Research, 85 (3): 625–635.CrossRefGoogle Scholar
  29. [29]
    Dawande, M. and Hooker, J. N. (1996). Inference-based sensitivity analysis for mixed integer/linear programming Technical report, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA. Note: also available at http: //www.gsia.cmu.edu/afs/andrew/gsia/jh38/mipsens.ps.Google Scholar
  30. [30]
    Derigs, U. (1985). Postoptimal analysis for matching problems. Methods of Operations Research, 49: 215–221.Google Scholar
  31. [31]
    Dey, T. K. (1997). Improved bounds for planar k-sets and related problems. Technical report, Department of Computer Science and Engineering, Indian Institute of Technology, Kharagpur, India 721–302.Google Scholar
  32. [32]
    Dixon, B., Rauch, M., and Tarjan, R. E. (1992). Verification and sensitivity analysis of minimum spanning trees in linear time. SIAM Journal on Computing, 21 (6): 1184–1192.CrossRefGoogle Scholar
  33. [33]
    Eppstein, D. (1995). Geometric lower bounds for parametric matroid optimization. Technical report 95–11, Department of Information & Computer ScienceGoogle Scholar
  34. [34]
    Eppstein, D. and Hirschberg, D. S. (1997). Choosing subsets with maximum weighted average. Journal of Algorithms, 24 (1): 177–193.CrossRefGoogle Scholar
  35. [35]
    Fernandez-Baca, D. and Medepalli, A. (1993). Parametric module allocation on partial k-trees. IEEE Transactions on Computers, 42: 738–742.CrossRefGoogle Scholar
  36. [36]
    Fernandez-Baca, D. and Slutzki, G. (1989). Solving parametric problems on trees. Journal of Algorithms, 10: 381–402.CrossRefGoogle Scholar
  37. [37]
    Fernandez-Baca, D. and Slutzki, G. (1994). Optimal parametric search in graphs of bounded tree-width. In Schmidt, E. and Skyum, S., editors, Algorithm Theory — 4th Scandinavian Workshop Proceedings, volume 824 of Lecture Notes in Computer Science, pages 155–166, Berlin, Germany. Springer-Verlag.Google Scholar
  38. [38]
    Fernandez-Baca, D. and Slutzki, G. (1994). Parametric problems on graphs of bounded tree-width. Journal of Algorithms, 16: 408–430.CrossRefGoogle Scholar
  39. [39]
    Fernandez-Baca, D. and Slutzki, G. (1995). Linear-time algorithms for parametric minimum spanning tree problems on planar graphs. In Baeza-Yates, R., Goles, E., and Poblete, P., editors, Latin 95: Theoretical Informatics — Second Latin American Google Scholar
  40. [40]
    Fernandez-Baca, D. and Slutzki, G. (1997). Optimal parametric problems on graphs of bounded tree-width. Journal of Algorithms, 22: 212–240.CrossRefGoogle Scholar
  41. [41]
    Fernandez-Baca, D., Slutzki, G., and Eppstein, D. (1996). Using sparsification for parametric minimum spanning tree problems. Nordic Journal of Computing, 3: 352–366.Google Scholar
  42. [42]
    Fernandez-Baca, D. and Srinivasan, S. (1991). Constructing the minimization diagram of a two-parameter problem. Operations Research Letters, 10: 87–93.CrossRefGoogle Scholar
  43. [43]
    Filonenko, N. V. (1979). Approximate solution of parametric integer programming problems. Cybernetics, 15: 703–707. Note: translated from Kibernetika 5: 9194, 1979.Google Scholar
  44. [44]
    Gal, T. and Greenberg, H., editors (1997). Advances in Sensitivity Analysis and Parametric Programming. Kluwer Academic Press, Boston, MA.Google Scholar
  45. [45]
    Geoffrion, A. M. and Nauss, R. (1977). Parametric and postoptimality analysis in integer linear programming Management Science, 23 (5): 453–466.CrossRefGoogle Scholar
  46. [46]
    Glover, F. and Greenberg, H. J. (1988). Logical testing for rule-base management. Annals of Operations Research, 12: 199–215.CrossRefGoogle Scholar
  47. [47]
    Glover, F., Mulvey, J. M., and Bai, D. (1996). Improved approaches to optimization via integrative population analysis. Technical report, Business School, University of Colorado, Boulder, CO.Google Scholar
  48. [48]
    Glover, F., Mulvey, J. M., Bai, D., and Tapia, M. T. (1997). Integrative population analysis for better solutions to large-scale mathematical programs. In Yu, G., editor, Industrial Applications of Combinatorial Optimization. Kluwer Academic Press, Boston, MA.Google Scholar
  49. [49]
    Gordeev, E. N. and Leontev, V. K. (1981). Stability in bottleneck problems. Computational Mathematics and Mathematical Physics, 20 (4): 275–280. Note: translated from Russian in Zhurnal Vychislitelnoi Matematiki Matematicheskoi Fiziki 20(4): 1071–1075, 1980.Google Scholar
  50. [50]
    Gordeev, E. N., Leontev, V. K., and Sigal, I. Kh. (1983). Computational algorithms for finding the radius of stability in problems of choice. Computational Mathematics and Mathematical Physics, 23(4): 973–979. Note: translated from Russian in Zhurnal Vychislitelnoi Matematiki Matematicheskoi Fiziki 23(4): 973–979, 1983 (“Problems of Choice” has been translated elsewhere as “Selection Problems”).Google Scholar
  51. [51]
    Greenberg, H. J. (1968). The use of branching in dynamic programming for parametric analysis. Operations Research, 15: 976–977.CrossRefGoogle Scholar
  52. [52]
    Greenberg, H. J. (1996). A bibliography for the development of an intelligent mathematical programming system. Annals of Operations Research, 65: 55–90. Note: also available at http: //orcs.bus.okstate.edu/itorms.Google Scholar
  53. [53]
    Greenberg, H. J. (1996–7). Mathematical Programming Glossary. World Wide Web, http: //www-math.cudenver.edu/Fhgreenbe/glossary/glossary.html.Google Scholar
  54. [54]
    Guieu, O. (1995). Analyzing infeasible mixed-integer and integer linear programs. M.Sc. thesis, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada.Google Scholar
  55. [55]
    Guieu, O. and Chinneck, J. W. (1996). Analyzing infeasible mixed-integer and integer linear programs. Technical report SCE-96–05, Department of Systems and Computer Engineering, Carleton University, Ottawa, Ontario, Canada.Google Scholar
  56. [56]
    Gusfield, D. (1979). Bounds for the parametric spanning tree problem. In Chinn, P. and McCarthy, D., editors, Combinatorics and Computing — Proceedings of the West Coast Conference on Graph Theory and Computing, pages 173–183, Winnipeg, Canada. Utilitas Mathematica. Note: This was difficult to obtain; its ISBN is 0 919628 26 5.Google Scholar
  57. [57]
    Gusfield, D. (1980). Sensitivity analysis for combinatorial optimization. Ph.d. thesis; Memo no. UCB/ERL M80/22, Electronics Research Laboratory, University of California, Berkeley, CA.Google Scholar
  58. [58]
    Gusfield, D. (1983). A note on arc tolerances in sparse shortest-path and network flow problems. Networks, 13 (2): 191–196.CrossRefGoogle Scholar
  59. [59]
    Gusfield, D. (1983). Parametric combinatorial computing and a problem in a program module allocation. Journal of the Association for Computing Machinery, 30 (3): 551–563.CrossRefGoogle Scholar
  60. [60]
    Hansen, P. and Ryan, J. (1996). Testing integer knapsacks for feasibility. European Journal of Operational Research, 88 (3): 578–582.CrossRefGoogle Scholar
  61. [61]
    Holm, S. and Klein, D. (1978). Discrete right hand side parameterization for linear integer programs. European Journal of Operational Research, 2: 50–53.CrossRefGoogle Scholar
  62. [62]
    Holm, S. and Klein, D. (1984). Three methods for postoptimal analysis in integer linear programming. Mathematical Programming Study, 21: 97–109.CrossRefGoogle Scholar
  63. [63]
    Hooker, J. N. (1996). Inference duality as a basis for sensitivity analysis. In Principles and Practice of Constraint Programming — CP96,volume 1118 of Lecture Notes in Computer Science,pages 224–236. Springer-Verlag, Berlin, Germany. Note: also available at http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/jnh.html.
  64. [64]
    Insua, D. R. and French, S. (1991). A framework for sensitivity analysis in discrete multi-objective decision-making. European Journal of Operational Research, 54 (2): 176–190.CrossRefGoogle Scholar
  65. [65]
    Jenkins, L. (1982). Parametric mixed integer programming- An application to solid waste management. Management Science, 28 (11): 1270–1284.CrossRefGoogle Scholar
  66. [66]
    Jenkins, L. (1987). Parametric-objective integer programming using knapsack facets and Gomory cutting planes. European Journal of Operational Research, 31 (1): 102–109.CrossRefGoogle Scholar
  67. [67]
    Jenkins, L. (1987). Using parametric integer programming to plan the mix of an air transport fleet. INFOR, 25 (2): 117–135.Google Scholar
  68. [68]
    Jenkins, L. (1990). Parametric methods in integer linear programming Annals of Operations Research, 27: 77–96.CrossRefGoogle Scholar
  69. [69]
    Jeroslow, R. G. and Wang, J. (1988). Dynamic programming, integral polyhedra, and horn clause knowledge bases. ORSA Journal on Computing, 1 (1): 7–19.CrossRefGoogle Scholar
  70. [70]
    Jones, C. V. (1996). Sensitivity Analysis for the Euclidean Traveling Salesman Problem. Technical report, University of Washington, World Wide Web, http: //weber.u.washington.edu/-cvj/tsphspnew.html.Google Scholar
  71. [71]
    Jones, C. V. (1997). The Stability of Solutions to the Euclidean Traveling Salesman Problem: Part I: Experimental Results. Technical report, School of Business Administration, University of Washington, Seattle, WA 98195. Note: also available at http: //is.badm.washington.edu/tsp.Google Scholar
  72. [72]
    Jones, C. V. (1997). The Stability of Solutions to the Euclidean Traveling Salesman Problem: Part II: Theoretical Results. Technical report, School of Business Administration, University of Washington, Seattle, WA 98195. Note: also available at http: //is.badm washington.edu/tsp.Google Scholar
  73. [73]
    Karp, R. M. and Orlin, J. B. (1981). Parametric shortest path algorithms with an application to cyclic staffing. Discrete Applied Mathematics, 3: 37–45.CrossRefGoogle Scholar
  74. [74]
    Kim, S. and Cho, S. (1988). A shadow price in integer programming for management decision. European Journal of Operational Research, 37: 328–335.CrossRefGoogle Scholar
  75. [75]
    Klein, D. and Holm, S. (1979). Integer programming postoptimal analysis with cutting planes. Management Science, 25 (1): 64–72.CrossRefGoogle Scholar
  76. [76]
    Kolen, A. W. J., Rinnooy Kan, A. H. G., van Hoesel, C. P. M., and Wagelmans, A. P. M. (1994). Sensitivity analysis of list scheduling heuristics. Discrete Applied Mathematics, 55 (2): 145–162.CrossRefGoogle Scholar
  77. [77]
    Komlös, J. (1985). Linear verification for spanning trees. Combinatorica, 5 (1): 57–65.CrossRefGoogle Scholar
  78. [78]
    Kravchenko, S. A., Sotskov, Yu. N., and Werner, E (1995). Optimal schedules with infinitely large stability radius. Optimization, 33: 271–280.CrossRefGoogle Scholar
  79. [79]
    Labbé, M., Thisse, J.-F., and Wendell, R. E. (1991). Sensitivity analysis in minisum facility location problems. Operations Research, 39 (6): 961–969.CrossRefGoogle Scholar
  80. [80]
    Lai, T.-C., Sotskov, Yu. N., Sotskova, N. Yu., and Werner, F. (1997). Optimal makespan scheduling with given bounds of processing times. Preprint 20/97, Ottovon-Guericke-Universität, Fakultaät Mathematik, Magdeburg, Germany.Google Scholar
  81. [81]
    Libura, M. (1980). Integer programming problems with inexact objective function. Control and Cybernetics, 9 (4): 189–202.Google Scholar
  82. [82]
    Libura, M. (1990). On traveling salesman problem with side constraints. In Kulikowski, R. and J.Sosnowski, editors, Badania Systemowe, t.2. Metody Optymalizacji i Sterowania Komputerowego, pages 134–142, Warszawa, Poland. Omnitech Press.Google Scholar
  83. [83]
    Libura, M. (1991). Sensitivity analysis for minimum Hamiltonian path and traveling salesman problems. Discrete Applied Mathematics, 30 (2): 197–211.CrossRefGoogle Scholar
  84. [84]
    Libura, M. (1991). Sensitivity analysis for the minimum weight base of a matroid. Control and Cybernetics, 20 (3): 7–24.Google Scholar
  85. [85]
    Libura, M. (1996). On accuracy of solutions for discrete optimization problems with perturbed coefficients of the objective function. Report PMMiO-1/96, Systems Research Institute, Polish Academy of Sciences, Newelska 6, 01–447, Warszawa, Poland. Note: to appear in Annals of Operations Research.Google Scholar
  86. [86]
    Libura, M. (1996). Optimality conditions and sensitivity analysis for combinatorial optimization problems. Control and Cybernetics, 25 (6): 1165–1180.Google Scholar
  87. [87]
    Lin, S. C. and Ma, E. (1991). Sensitivity analysis of 0–1 multiterminal network flows. Networks, 21 (7): 713–745.CrossRefGoogle Scholar
  88. [88]
    Loukakis, E. and Muhlemann, A. P. (1984). Parameterisation algorithms for the integer linear programs in binary variables. European Journal of Operational Research, 17: 104–115.CrossRefGoogle Scholar
  89. [89]
    Marsten, R. E. and Morin, T. L. (1977). Parametric integer programming: The right-hand side case. Annals of Discrete Mathematics, 1: 375–390.CrossRefGoogle Scholar
  90. [90]
    McBride, R. D. and Yormark, J. S. (1980). Finding all solutions for a class of parametric quadratic integer programming problems. Management Science, 26 (8): 784–795.CrossRefGoogle Scholar
  91. [91]
    Megiddo, N. (1979). Combinatorial optimization with rational objective functions. Mathematics of Operations Research, 4 (4): 414–424.CrossRefGoogle Scholar
  92. [92]
    Nauss, R. M. (1979). Parametric Integer Programming. University of Missouri Press, Columbia, Missouri.Google Scholar
  93. [93]
    Ohtake, Y. and Nishida, N. (1985). A branch-and-bound algorithm for 0–1 parametric mixed integer programming Operations Research Letters, 4 (1): 41–45.CrossRefGoogle Scholar
  94. [94]
    Richter, K. and Vörös, J. (1989). A parametric analysis of the dynamic lot-sizing problem. Journal of Information Processing Cybernetics, 25 (3): 67–73.Google Scholar
  95. [95]
    Rountree, S. L. K. and Gillett, B. E. (1982). Parametric integer linear programming: A synthesis of branch and bound with cutting planes. European Journal of Operational Research, 10: 183–189.CrossRefGoogle Scholar
  96. [96]
    Ryan, J. (1990). The structure of an integral monoid and integer programming feasibility. Discrete Applied Mathematics, 28 (3): 251–264.CrossRefGoogle Scholar
  97. [97]
    Schrage, L. (1997). Optimization Modeling with UNDO. Duxbury Press, Pacific Grove, CA, 5th edition.Google Scholar
  98. [98]
    Schrage, L. and Wolsey, L. A. (1985). Sensitivity analysis for branch and bound integer programming. Operations Research, 33 (5): 1008–1023.CrossRefGoogle Scholar
  99. [99]
    Sergienko, I. V. and Kozeratskaya, L. N. (1982). Solution of a parametric integer programming problem. Cybernetics, 18: 360–367. Note: translated from Kibernetika 3: 80–84, 1982.Google Scholar
  100. [101]
    Shapiro, J. F. (1977). Sensitivity analysis in integer programming. Annals of Discrete Mathematics, 1: 467–477.CrossRefGoogle Scholar
  101. [102]
    Shier, D. R. and Witzgall, C. (1980). Arc tolerances in shortest path and network flow problems. Networks, 10 (4): 277–291.CrossRefGoogle Scholar
  102. [103]
    Skorin-Kapov, J. and Granot, F. (1987). Non-linear integer programming. Sensitivity analysis for branch and bound. Operations Research Letters, 6 (6): 269–274.CrossRefGoogle Scholar
  103. [104]
    Sokkalingam, P. T., Ahuja, R. K., and Orlin, J. B. (1996). Solving inverse spanning tree problems through network flow techniques. Working paper WP 3914–96, MIT Sloan School, Cambridge, MA.Google Scholar
  104. [105]
    Sotskov, Yu. N. (1989). Stability of high-speed optimal schedules. Computational Mathematics and Mathematical Physics, 29 (3): 57–63. Note: translated from Russian in Zhurnal Vychislitelnoi Matematiki Matematicheskoi Fiziki 29(5): 723–731, 1989.Google Scholar
  105. [106]
    Sotskov, Yu. N. (1991). Stability of an optimal schedule. European Journal of Operational Research, 55: 91–102.CrossRefGoogle Scholar
  106. [107]
    Sotskov, Yu. N. (1993). The stability of the approximate Boolean minimization of a linear form. Computational Mathematics and Mathematical Physics, 33 (5): 699–707. Note: translated from Russian in Zhurnal Vychislitelnoi Matematiki Matematicheskoi Fiziki 33(5): 785–795, 1993.Google Scholar
  107. [108]
    Sotskov, Yu. N., Leontev, V. K., and Gordeev, E. N. (1995). Some concepts of stability analysis in combinatorial optimization. Discrete Applied Mathematics, 58 (2): 169–190.CrossRefGoogle Scholar
  108. [109]
    Sotskov, Yu. N., Sotskova, N. Yu., and Werner, F. (1997). Stability of an optimal schedule in a job shop. OMEGA, 25 (5). To appear.Google Scholar
  109. [110]
    Sotskov, Yu. N., Tanaev, V. S., and Werner, F. (1997). Stability radius of an optimal schedule: A survey and recent developments. In Yu, G., editor, Industrial Applications of Combinatorial Optimization. Kluwer Academic Press, Boston, MA. To appear.Google Scholar
  110. [111]
    Sotskov, Yu. N., Wagelmans, A. P. M., and Werner, F. (1997). On the calculation of the stability radius of an optimal or an approximate schedule. Report 9718/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.Google Scholar
  111. [112]
    Sturmfels, B. and Thomas, R. R. (1997). Variation of cost functions in integer programming Mathematical Programming, 77: 357–387.Google Scholar
  112. [113]
    Tarjan, R. E. (1982). Sensitivity analysis of minimum spanning trees and shortest path problems. Information Processing Letters, 14 (1): 30–33.CrossRefGoogle Scholar
  113. [114]
    Tayi, G. K. (1985). Sensitivity analysis of mixed integer programs: An application to environmental policy making European Journal of Operational Research, 22: 224–233.CrossRefGoogle Scholar
  114. [115]
    Turgeon, A. (1987). An application of parametric mixed-integer linear programming to hydropower development. Water Resources Research, 23 (3): 399–407.CrossRefGoogle Scholar
  115. [116]
    van der Poort, E. S. (1997). Aspects of sensitivity analysis for the traveling salesman problem. Ph.d. thesis, Graduate School/Research Institute Systems, Organizations and Management, University of Groningen, P.O. Box 800, Groningen, The Netherlands.Google Scholar
  116. [117]
    van der Poort, E. S., Dimitrijevic, V., Sierksma, G., and van der Veen, J. A. A. (1997). Using stability information for finding the k-best traveling salesman problem. Research report 97A29, Graduate School/Research Institute Systems, Organizations and Management, University of Groningen, P.O. Box 800, Groningen, The Netherlands. Note: this is Chapter 5 in [116].Google Scholar
  117. [118]
    van der Poort, E. S., Libura, M., Sierksma, G., and van der Veen, J. A. A. (1996). Sensitivity analysis based on k-best solutions of the traveling salesman problem. Research report 96A14, Graduate School/Research Institute Systems, Organizations and Management, University of Groningen, P.O. Box 800, Groningen, The Netherlands. Note: this is Chapter 6 in [116], and it is to appear in Annals of Operations Research.Google Scholar
  118. [119]
    van der Poort, E. S., Sierksma, G., and van der Veen, J. A. A. (1997). Determining tolerances for the traveling salesman problem. Research report 97A27, Graduate School/Research Institute Systems, Organizations and Management, University of Groningen, P.O. Box 800, Groningen, The Netherlands. Note: this is Chapter 2 in [116].Google Scholar
  119. [120]
    van der Poort, E. S., Sierksma, G., and van der Veen, J. A. A. (1997). Stability regions for the symmetric traveling salesman problem. Research report 97A28, Graduate School/Research Institute Systems, Organizations and Management, University of Groningen, P.O. Box 800, Groningen, The Netherlands. Note: this is Chapter 3 in [116].Google Scholar
  120. [121]
    van Hoesel, C. P. M., Kolen, A. W. J., Rinnooy Kan, A. H. G., and Wagelmans, A. (1989). Sensitivity analysis in combinatorial optimization: A bibliography. Technical report 8944/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.Google Scholar
  121. [122]
    van Hoesel, S. and Wagelmans, A. (1993). Sensitivity analysis of the economic lot-sizing problem. Discrete Applied Mathematics, 45 (3): 291–312.CrossRefGoogle Scholar
  122. [123]
    van Hoesel, S. and Wagelmans, A. (1996). On the complexity of postoptimality analysis of 0/1 programs. Report 9660/A, Econometric Institute, Erasmus University, Rotterdam, The Netherlands. Note: supersedes 1991 report, 9167/A, by same authors; to appear in Discrete Applied Mathematics.Google Scholar
  123. [124]
    Villarreal, B. and Karwan, M. H. (1981). Parametric multicriteria integer programming. Annals of Discrete Mathematics, 11: 371–379.Google Scholar
  124. [125]
    von Randow, R., editor (1985). Integer Programming and Related Areas: A Classified Bibliography 1981–1984, volume 243 of Lecture Notes in Economics and Mathematical Systems. Springer-Verlag, Berlin, Germany.Google Scholar
  125. [126]
    Wagelmans, A. P. M. (1990). Sensitivity analysis in combinatorial optimization. Ph.d. thesis, Econometric Institute, Erasmus University, Rotterdam, The Netherlands.Google Scholar
  126. [127]
    Wallace, S. W. (1996). Is sensitivity analysis of any use? Technical note, Faculty of Social Sciences and Technology Management, Norwegian University of Science and Technology, N-7034 Trondheim, Norway.Google Scholar
  127. [128]
    Wang, H.-F. and Horng, J.-S. (1996). Directed perturbation analysis of an integer program. Journal of Mathematical Analysis and Applications, 201 (2): 447–460.CrossRefGoogle Scholar
  128. [129]
    Wang, H.-F. and Horng, J.-S. (1996). Structural approach to parametric analysis of an IP on the case of right-hand side. European Journal of Operational Research, 92 (1): 148–156.CrossRefGoogle Scholar
  129. [130]
    Weber, G. M. (1981). Sensitivity analysis of optimal matchings. Networks, 11 (1): 41–56.CrossRefGoogle Scholar
  130. [131]
    Williams, A. C. (1989). Marginal values in mixed integer linear programming. Mathematical Programming, 44: 67–75.CrossRefGoogle Scholar
  131. [132]
    Williams, H. P. (1979). The economic interpretation of duality for practical mixed integer programming problems. In Prékopa, A., editor, Survey: Mathematical Programming, Proceedings of the 9th International Mathematical Programming Symposium, volume 2, pages 567–586, Amsterdam, The Netherlands. North Holland.Google Scholar
  132. [133]
    Williams, H. P. (1996). Constructing the value function for an integer linear programme over a cone. Computational Optimization and Applications, 6: 15–26.CrossRefGoogle Scholar
  133. [134]
    Williams, H. P. (1996). Duality in mathematics and linear and integer programming. Journal of Optimization Theory and Applications, 90 (2): 257–278.CrossRefGoogle Scholar
  134. [135]
    Williams, H. P. (1997). Integer programming and pricing revisited. IMA Journal of Mathematics Applied in Business & Industry, 8: 1–11.Google Scholar
  135. [136]
    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.CrossRefGoogle Scholar
  136. [137]
    Wolsey, L. A. (1981). Integer programming duality: Price functions and sensitivity analysis. Mathematical Programming, 20 (2): 173–195.CrossRefGoogle Scholar

Copyright information

© Springer Science+Business Media New York 1998

Authors and Affiliations

  • Harvey J. Greenberg
    • 1
  1. 1.Mathematics DepartmentUniversity of Colorado at DenverDenverUSA

Personalised recommendations