On the application of explanation-based learning to acquire control knowledge for branch and bound algorithms

INFORMS Journal on Computing

Volumn 10, Issue 1, 1998, Pages 56-71

  Realff, Matthew J ^a   Stephanopoulos, George ^a  

^a Massachusetts Institute of Technology Cambridge   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0345728390     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.1.56     Document Type: Article

References (25)

1. W.F. CLOCKSIN and C.S. MELLISH, 1984. Programming in PROLOG, Springer Verlag, Berlin.
2. G.F. DEJONG and R. MOONEY, 1986. Explanation-Based Learning: An Alternative View, Machine Learning 1, 145-176.
3. A. FADLALLA and J.R. EVANS, 1995. Improving the Performance of Enumerative Search Methods. I. Exploiting Structure and Intelligence. Computers and Operations Research 22, 605-613.
4. A. FADLALLA, J.R. EVANS, and M.S. LEVY, 1995. Improving the Performance of Enumerative Search Methods. II. Computational Experiments, Computers and Operations Research 22, 987-994.
5. R. FIKES, P. HART, and N. NILSSON, 1972. Learning and Executing Generalized Robot Plans, Artificial Intelligence 3, 251-288.
6. F. GLOVER, 1986. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research 13, 533-549.
7. F. GLOVER and H.J. GREENBERG, 1989. New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research 39, 119-130.
8. T. IBARAKI, 1977. The Power of Dominance Relations in Branch Bound Algorithms, Journal of the Association of Computing Machinery 24:2, 264-279.
9. T. IBARAKI, 1978. Branch and Bound Procedure and State-Space Representation of Combinatorial Optimization Problems, Information and Control 36, 1-27.
10. R.M. KARP and M. HELD, 1967. Finite-State Processes and Dynamic Programming, SIAM Journal of Applied Mathematics 15, 698-718.
11. W.H. KOHLER and K. STEIGLITZ, 1974. Characterization and Theoretical Comparison of Branch and Bound Algorithms for Permutation Problem, Journal of the Association of Computing Machinery 21:1, 140-156.
12. E. KONDILI, C. PANTELIDES, and R.W.H. SARGENT, 1993. A General Algorithm for Short-Term Scheduling of Batch Operations. I. MILP Formulation, Computers and Chemical Engineering 17:2, 211-227.
13. V. KUMAR and L.N. KANAL, 1988. The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch and Bound, in Search in Artificial Intelligence, Springer Verlag, Berlin.
14. B.J. LAGWEG, J.K. LENSTRA, and A.H.G. RINNOOY KAN, 1978. A General Bounding Scheme for the Permutation Flow-Shop Problem, Operations Research 26:1, 53-67.
15. E.L. LAWLER and D.E. WOOD, 1966. Branch and Bound Methods: A Survey, Operations Research 14, 699-719.
16. D.L. MILLER and J.F. PEKNY, 1991. Exact Solution of Large Asymmetric Traveling Salesman Problems, Science 251, 754-761.
17. S. MINTON, 1988. Learning Search Control Knowledge: An Explanation-Based Approach, Kluwer, Norwell, Massachusetts.
18. S. MINTON, J. CARBONELL, C. KNOBLOCK, D. KUOKKA, O. ETZIONI, and Y. GIL, 1990. Explanation-Based Learning: A Problem Solving Perspective, in Machine Learning, Paradigms and Methods, J.G. Carbonell, (ed.), Massachusetts Institute of Technology, Elsevier, Amsterdam, The Netherlands.
19. T.M. MITCHELL, S. MAHADEVAN, and L.I. STEINBERG, 1985. LEAP: A Learning Apprentice for VSLI Design, Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, California, 573-580.
20. R.J. MOONEY, 1990. A General Explanation-Based Learning Mechanism and its Application to Narrative Understanding, Morgan Kaufmann, San Francisco, California.
21. G.L. NEMHAUSER, M.W.P. SAVELSBERGH, and G.C. SIGISMONDI, 1994. MINTO, a Mixed INTeger Optimizer, Operations Research Letters 15:1, 47-58.
22. N.J. NILSSON, 1980. Principles of Artificial Intelligence, Tioga, Palo Alto, California.
23. M.J. REALFF, 1992. Machine Learning for the Improvement of Branch and Bound Algorithms: A Case Study in Batch Scheduling, Ph.D. thesis, Massachusetts Institute of Technology.
24. N. SHAH, C.C. PANTELIDES, and R.W.H. SARGENT, 1993. A General Algorithm for Short-Term Scheduling of Batch Operations. II. Computational Issues, Computers and Chemical Engineering 17:2, 229-244.
25. J.W. SHAVLIK, 1990. Extending Explanation-Based Learning by Generalizing the Structure of Explanations, Morgan Kaufmann, San Francisco, California.