Inference duality as a basis for sensitivity analysis

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1118, Issue , 1996, Pages 224-236

  Hooker, J N ^a  

^a CARNEGIE MELLON UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84957881356     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61551-2_77     Document Type: Conference Paper

References (14)

1. Barth, P., Logic-Based 0-1 Constraint Solving in Constraint Logic Programming Kluwer (Dordrecht, 1995).
2. Chvatál, V., Linear Programming, W. H. Freeman (New York, 1983).
3. Cooper, M. C., An optimal k-consistency algorithm, Artificial Intelligence 41 (1989) 89-95.
4. Hooker, J. N., A quantitative approach to logical inference, Decision Support Systems 4 (1988) 45-69
5. Hooker, J N, Generalized resolution for 0-1 linear inequalities, Annals of Mathematics and Artificial Intelligence 6 (1992) 271-286.
6. Hooker, J. N., Logic-based methods for optimization, in A. Borning, ed., Principles and Practice of Constraint Programming, Lecture Notes in Computer Science 874 (1994) 336-349.
7. Hooker, J. N., Logic-based Benders decomposition (1996). Available on http://www.gsia.cmu.edu/afs/andrew/afs/jh38/jnh.html.
8. Nemhauser, G. L., and L. A. Wolsey, Integer and Combinatorial Optimization, Wiley (New York, 1988).
9. Quine, W. V., The problem of simplifying truth functions, American Mathematical Monthly 59 (1952) 521-531.
10. Quine, W. V., A way to simplify truth functions, American Mathematical Monthly 62 (1955) 627-631.
11. Robinson, J. A., A machine-oriented logic based on the resolution principle, Journal of the ACM 12 (1965) 23-41.
12. Schrage, L., and L. Wolsey, Sensitivity analysis for branch and bound integer programming, Operations Research 33 (1985) 1008-1023.
13. Schrijver, A., Theory of Linear and Integer Programming, Wiley (Chichester, 1986).
14. Skorin-Kapov, J., and P. Granot, Nonlinear integer programming: Sensitivity analysis for branch and bound, Operations Research Letters 6 (1987) 269-274.