Inference-Based Sensitivity Analysis for Mixed Integer/Linear Programming

References

• Blair C. E., Gal T., Greenberg H. J. Integer and mixed integer programming. Recent Advances in Sensitivity Analysis and Parametric Programming (2000) (Kluwer). to appearGoogle Scholar
• Blair C. E., Jeroslow R. G. The value function of a mixed integer program I. Discrete Appl. Math. (1977a) 19:121–138Crossref, Google Scholar
• Blair C. E., Jeroslow R. G. The value function of a mixed integer program: II. Discrete Appl. Math. (1977b) 25:7–19Crossref, Google Scholar
• Blair C. E., Jeroslow R. G. The value function of an integer program. Math. Programming (1982) 23:237–273Crossref, Google Scholar
• Blair C. E., Jeroslow R. G. Constructive characterizations of the value function of a mixed-integer program I. Discrete Appl. Math. (1984) 9:217–233Crossref, Google Scholar
• Blair C. E., Jeroslow R. G. Constructive characterizations of the value function of a mixed-integer program II. Discrete Appl. Math. (1985) 10:227–240Crossref, Google Scholar
• Cook W., Gerards A. M. H., Schrijver A., Tardos E. Sensitivity theorems in integer linear programming. Math. Programming (1986) 34:251–264Crossref, Google Scholar
• Dawande M., Gavirneni S., Tayur S. Effective heuristics for multi-product shipment models. (1996) . Tech. Report TR-96-05, GSIA, Carnegie Mellon UniversityGoogle Scholar
• Hooker J. N. A quantitative approach to logical inference. Decision Support Systems (1988) 4:45–69Crossref, Google Scholar
• Hooker J. N. Generalized resolution for 0-1 linear inequalities. Ann. Math. and Artificial Intelligence (1992) 6:271–286Crossref, Google Scholar
• Hooker J. N., Borning A. Logic-based methods for optimization. Principles and Practice of Constraint Programming, Lecture Notes in Computer Science (1994) 874:336–349Crossref, Google Scholar
• Hooker J. N. Logic-based Benders decomposition. (1996a) . Available on http://www.gsia.cmu.edu/afs/andrew/gsia/jh38/papers.htmlGoogle Scholar
• Hooker J. N., Freuder E. C. Inference duality as a basis for sensitivity analysis. Principles and Practice of Constraint Programming–CP96 (1996b) (Springer)224–236Lecture Notes in Computer Science 1118Also to appear in ConstraintsCrossref, Google Scholar
• Hooker J. N., Osorio M. A. Mixed logical/linear programming. Discrete Appl. Math. (1999) 96-97:395–442Crossref, Google Scholar
• Nemhauser G. L., Wolsey L. A.Integer Programming and Combinatorial Optimization (1988) (Wiley, New York) Google Scholar
• Peterson C. C. Selection of new research and development opportunities in light of budget constraints. (1965) . Master's Thesis, Arizona State UniversityGoogle Scholar
• Peterson C. C. Computational experience with variants of the Balas algorithm applied to the selection of R&D projects. Management Sci. (1967) 13:736–750Link, Google Scholar
• Quine W. V. The problem of simplifying truth functions. Amer. Math. Monthly (1952) 59:521–531Crossref, Google Scholar
• Quine W. V. A way to simplify truth functions. Amer. Math. Monthly (1955) 62:627–631Crossref, Google Scholar
• Schrage L., Wolsey L. Sensitivity analysis for branch and bound integer programming. Oper. Res. (1985) 33:1008–1023Link, Google Scholar
• Skorin-Kapov J., Granot F. Nonlinear integer programming: Sensitivity analysis for branch and bound. Oper. Res. Lett. (1987) 6:269–274Crossref, Google Scholar
• Tind J., Wolsey L. A. An elementary survey of general duality theory in mathematical programming. Math. Programming (1981) 21:241–261Crossref, Google Scholar
• Tsang E.Foundations of Constraint Satisfaction (1993) (Academic Press, London) Google Scholar
• Wolsey L. A. Integer programming duality: price functions and sensitivity analysis. Math. Programming (1981a) 20:173–195Crossref, Google Scholar
• Wolsey L. A. The b-hull of an integer program. Discrete Appl. Math. (1981b) 3:193–201Crossref, Google Scholar