On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms

Published Online:https://doi.org/10.1287/ijoc.10.1.56

References

  • Clocksin W. F. , Mellish C. S. Programming in PROLOG (1984) (Springer Verlag, Berlin) CrossrefGoogle Scholar
  • DeJong G. F. , Mooney R. Explanation-Based Learning: An Alternative View. Machine Learning (1986) 1 145 176 CrossrefGoogle Scholar
  • Fadlalla A. , Evans J. R. Improving the Performance of Enumerative Search Methods. I. Exploiting Structure and Intelligence. Computers and Operations Research (1995) 22 605 613 CrossrefGoogle Scholar
  • Fadlalla A. , Evans J. R. , Levy M. S. Improving the Performance of Enumerative Search Methods. II. Computational Experiments. Computers and Operations Research (1995) 22 987 994 CrossrefGoogle Scholar
  • Fikes R. , Hart P. , Nilsson N. Learning and Executing Generalized Robot Plans. Artificial Intelligence (1972) 3 251 288 CrossrefGoogle Scholar
  • Glover F. Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research (1986) 13 533 549 CrossrefGoogle Scholar
  • Glover F. , Greenberg H. J. New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research (1989) 39 119 130 CrossrefGoogle Scholar
  • Ibaraki T. The Power of Dominance Relations in Branch Bound Algorithms. Journal of the Association Computing Machinery (1977) 24 2 264 279 CrossrefGoogle Scholar
  • Ibaraki T. Branch and Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control (1978) 36 1 27 CrossrefGoogle Scholar
  • Karp R. M. , Held M. Finite-State Processes and Dynamic Programming. SIAM Journal of Applied Mathematics (1967) 15 698 718 CrossrefGoogle Scholar
  • Kohler W. H. , Steiglitz K. Characterization and Theoretical Comparison of Branch and Bound Algorithms for Permutation Problem. Journal of the Association Computing Machinery (1974) 21 1 140 156 CrossrefGoogle Scholar
  • Kondili E. , Pantelides C. , Sargent R. W. H. A General Algorithm for Short-Term Scheduling of Batch Operations. I. MILP Formulation. Computers and Chemical Engineering (1993) 17 2 211 227 CrossrefGoogle Scholar
  • Kumar V. , Kanal L. N. The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch and Bound. Search in Artificial Intelligence (1988) (Springer Verlag, Berlin) CrossrefGoogle Scholar
  • Lagweg B. J. , Lenstra J. K. , Rinnooy Kan A. H. G. A General Bounding Scheme for the Permutation Flow-Shop Problem. Operations Research (1978) 26 1 53 67 LinkGoogle Scholar
  • Lawler E. L. , Wood D. E. Branch and Bound Methods: A Survey. Operations Research (1966) 14 699 719 LinkGoogle Scholar
  • Miller D. L. , Pekny J. F. Exact Solution of Large Asymmetric Traveling Salesman Problems. Science (1991) 251 754 761 CrossrefGoogle Scholar
  • Minton S. Learning Search Control Knowledge: An Explanation-Based Approach. (1988) (Kluwer, Norwell, Massachusetts) CrossrefGoogle Scholar
  • Minton S. , Carbonell J. , Knoblock C. , Kuokka D. , Etzioni O. , Gil Y. , Carbonell J. G. Explanation-Based Learning: A Problem Solving Perspective. Machine Learning, Paradigms and Methods (1990) (Massachusetts Institute of Technology, Elsevier, Amsterdam, The Netherlands) Google Scholar
  • Mitchell T. M. , Mahadevan S. , Steinberg L. I. LEAP: A Learning Apprentice for VSLI Design. Proceedings of the 9th International Joint Conference on Artificial Intelligence (1985) Los Angeles, California 573 580 Google Scholar
  • Mooney R. J. A General Explanation-Based Learning Mechanism and its Application to Narrative Understanding (1990) (Morgan Kaufmann, San Francisco, California) Google Scholar
  • Nemhauser G. L. , Savelsbergh M. W. P. , Sigismondi G. C. MINTO, a Mixed INTeger Optimizer. Operations Research Letters (1994) 15 1 47 58 CrossrefGoogle Scholar
  • Nilsson N. J. Principles of Artificial Intelligence (1980) (Tioga, Palo Alto, California) Google Scholar
  • Realff M. J. Machine Learning for the Improvement of Branch and Bound Algorithms: A Case Study in Batch Scheduling (1992) . Ph.D. thesis Massachusetts Institute of Technology Google Scholar
  • Shah N. , Pantelides C. C. , Sargent R. W. H. A General Algorithm for Short-Term Scheduling of Batch Operations. II. Computational Issues. Computers and Chemical Engineering (1993) 17 2 229 244 CrossrefGoogle Scholar
  • Shavlik J. W. Extending Explanation-Based Learning by Generalizing the Structure of Explanations (1990) (Morgan Kaufmann, San Francisco, California) Google Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.