Efficient Intelligent Backtracking Using Linear Programming

References

• Balas E. Facets of the Knapsack Polytope. Mathematical Programming (1975) 8:146–164Crossref, Google Scholar
• Beasley J. OR-Library: distributing test problems by electronic mail. Journal of the Operational Research Society (1990) 41:1069–Crossref, Google Scholar
• Bixby R. E., Ceria S., McZeal C., Savelsbergh M. An updated mixed integer Programming library: MIPLIB 3.0. Optima (1998) 54:12–15Google Scholar
• Bruynooghe M. Solving combinatorial search problems by intelligent backtracking. Information Processing Letters (1981) 12:36–39Crossref, Google Scholar
• Burg J., Lang S.-D., Hughes C., P. V. Hentenryck. Finding conflict sets and backtrack points in CLP-R. Proceedings of the Eleventh International Conference on Logic Programming (1994) (MIT Press, Cambridge MA) 323–338Google Scholar
• Ceria S., Cordier C., Marchand H., Wolsey L. A. Cutting planes for integer programs with general integer variables. Mathematical Programming (1998) 81:201–214Crossref, Google Scholar
• Chinneck J., T. Gal, Greenberg H. Feasibility and Viability. Advances in Sensitivity Analysis and Parametric Programming Vol. 6 of International Series in Operations Research and Management Science (1997) (Kluwer Academic Publishers, Boston MA) 14–1Crossref, Google Scholar
• Dawande M., Cornuejols G. A class of hard, small integer problems. INFORMS Journal on Computing (1999) 11:205–210Link, Google Scholar
• Fan K., H. Kuhn, Tucker A. On systems of linear inequalities. Linear Inequalities and Related Systems Number 38 Annals of Mathematical Studies (1956) (Princeton University Press, Princeton, N.J.) 99–156Google Scholar
• Havens W. S. Intelligent backtracking in the echidna constraint logic programming system. International Journal of Expert Systems (1992) 5:319–343Google Scholar
• Hooker J. N., Ottoson G. Logic based Benders decomposition. Mathematical Programming (1995) . ForthcomingGoogle Scholar
• Johnson D. S., Trick M. A.DIMACS Series in Discrete Mathematics and Theoretical Computer Science. Volume 23: Cliques, Coloring and Satisfiability (1996) (American Mathematical Society, Providence, RI) Google Scholar
• Nemhauser G. L., Savelsbergh M. W. P., Sigismondi G. S. MINTO, a Mixed INTeger Optimizer. Operations Research Letters (1994) 15:47–58Crossref, Google Scholar
• Nemhauser G. L. Wolsey. Integer and Combinatorial Optimization (1998) (Wiley, New York) Google Scholar
• Parker M., Ryan J. Finding the minimum weight IIS cover of an infeasible system of linear inequalities. Annals of Mathematics and Artificial Intelligence (1996) 17:107–126Crossref, Google Scholar
• Richards E. T., Richards B., E. C. Freuder. Nogood Learning for Constraint Satisfaction. Proceedings of the Second International Conference on Principles and Practice of Constraint Programming Vol. 1118 of Lecture Notes in Computer Science (1996) (Springer-Verlag)Google Scholar
• Savelsbergh M. W. P., Nemhauser G. L. N.Functional Description of MINTO, a Mixed INTeger Optimizer, Version 3.0 (1998) (Georgia Institute of Technology, Atlanta, GA) Google Scholar