On the Application of Explanation-Based Learning to Acquire Control Knowledge for Branch and Bound Algorithms
Published Online:1 Feb 1998https://doi.org/10.1287/ijoc.10.1.56
References
- Programming in PROLOG (1984) (Springer Verlag, Berlin) Crossref, Google Scholar
- Explanation-Based Learning: An Alternative View. Machine Learning (1986) 1 145 176 Crossref, Google Scholar
- Improving the Performance of Enumerative Search Methods. I. Exploiting Structure and Intelligence. Computers and Operations Research (1995) 22 605 613 Crossref, Google Scholar
- Improving the Performance of Enumerative Search Methods. II. Computational Experiments. Computers and Operations Research (1995) 22 987 994 Crossref, Google Scholar
- Learning and Executing Generalized Robot Plans. Artificial Intelligence (1972) 3 251 288 Crossref, Google Scholar
- Future Paths for Integer Programming and Links to Artificial Intelligence. Computers and Operations Research (1986) 13 533 549 Crossref, Google Scholar
- New Approaches for Heuristic Search: A Bilateral Linkage with Artificial Intelligence. European Journal of Operational Research (1989) 39 119 130 Crossref, Google Scholar
- The Power of Dominance Relations in Branch Bound Algorithms. Journal of the Association Computing Machinery (1977) 24 2 264 279 Crossref, Google Scholar
- Branch and Bound Procedure and State-Space Representation of Combinatorial Optimization Problems. Information and Control (1978) 36 1 27 Crossref, Google Scholar
- Finite-State Processes and Dynamic Programming. SIAM Journal of Applied Mathematics (1967) 15 698 718 Crossref, Google Scholar
- Characterization and Theoretical Comparison of Branch and Bound Algorithms for Permutation Problem. Journal of the Association Computing Machinery (1974) 21 1 140 156 Crossref, Google Scholar
- A General Algorithm for Short-Term Scheduling of Batch Operations. I. MILP Formulation. Computers and Chemical Engineering (1993) 17 2 211 227 Crossref, Google Scholar
- The CDP: A Unifying Formulation for Heuristic Search, Dynamic Programming, and Branch and Bound. Search in Artificial Intelligence (1988) (Springer Verlag, Berlin) Crossref, Google Scholar
- A General Bounding Scheme for the Permutation Flow-Shop Problem. Operations Research (1978) 26 1 53 67 Link, Google Scholar
- Branch and Bound Methods: A Survey. Operations Research (1966) 14 699 719 Link, Google Scholar
- Exact Solution of Large Asymmetric Traveling Salesman Problems. Science (1991) 251 754 761 Crossref, Google Scholar
- Learning Search Control Knowledge: An Explanation-Based Approach. (1988) (Kluwer, Norwell, Massachusetts) Crossref, Google Scholar
- , 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
- 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
- A General Explanation-Based Learning Mechanism and its Application to Narrative Understanding (1990) (Morgan Kaufmann, San Francisco, California) Google Scholar
- MINTO, a Mixed INTeger Optimizer. Operations Research Letters (1994) 15 1 47 58 Crossref, Google Scholar
- Principles of Artificial Intelligence (1980) (Tioga, Palo Alto, California) Google Scholar
- 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
- A General Algorithm for Short-Term Scheduling of Batch Operations. II. Computational Issues. Computers and Chemical Engineering (1993) 17 2 229 244 Crossref, Google Scholar
- Extending Explanation-Based Learning by Generalizing the Structure of Explanations (1990) (Morgan Kaufmann, San Francisco, California) Google Scholar

