Logic, Optimization, and Constraint Programming

References

• Adams W. P., Billionnet A., Sutter A. Unconstrained 0-1 optimization, and Lagrangean relaxation. Discrete Applied Mathematics (1990) 29:131–142Crossref, Google Scholar
• Adams W. P., Dearing P. M. On the equivalence between roof duality and Lagrangean duality for unconstrained 0-1 quadratic programming problems. Discrete Applied Mathematics (1994) 48:1–20Crossref, Google Scholar
• Aggoun A., Dincbas M., Herold A., Simonis H., Van Hentenryck P. The CHIP system. (1987) . Technical Report TR-LP-24, European Computer Industry Research Centre (ECRC), Munich, GermanyGoogle Scholar
• Arnborg S., Corneil D. G., Proskurowski A. Complexity of finding embeddings in a k-tree. SIAM Journal on Algebraic and Discrete Mathematics (1987) 8:277–284Crossref, Google Scholar
• Arnborg S., Proskurowski A. Characterization and recognition of partial k-trees. SIAM Journal on Algebraic and Discrete Mathematics (1986) 7:305–314Crossref, Google Scholar
• Balas E. Intersection cuts from disjunctive constraints. (1974) . Management Sciences Research Report No. 330, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Balas E., Mangasarian O. L., Meyer R. R., Robinson S. M. Disjunctive programming: cutting planes from logical conditions. Nonlinear Programming 2 (1975) (Academic Press, New York) 279–312Crossref, Google Scholar
• Balas E. A note on duality in disjunctive programming. Journal of Optimization Theory and Applications (1977) 21:523–527Crossref, Google Scholar
• Balas E. Disjunctive programming. Annals Discrete Mathematics (1979) 5:3–51Crossref, Google Scholar
• Balas E., Ceria S., Cornuéjols G. Mixed 0-1 programming by lift-and-project in a branch and cut framework. Management Science (1996) 42:1229–Link, Google Scholar
• Balas E., Jeroslow R. Canonical cuts on the unit hypercube. SIAM Journal on Applied Mathematics (1972) 23:61–69Crossref, Google Scholar
• Balas E., Mazzola J. B. Nonlinear 0-1 programming: I. linearization techniques. Mathematical Programming (1980a) 30:1–20Crossref, Google Scholar
• Balas E., Mazzola and J. B. Nonlinear 0-1 programming: II. dominance relations and algorithms. Mathematical Programming (1980b) 30:22–45Crossref, Google Scholar
• Barth P.Logic-Based 0-1 Constraint Solving in Constraint Logic Programming (1995) (Kluwer, Dordrecht, The Netherlands) . The system OPBDP is available at http://ww.mpi-sb.mpg.de/units/ag2/software/opbdpGoogle Scholar
• Beaumont N. An algorithm for disjunctive programs. European Journal of Operational Research (1990) 48:362–371Crossref, Google Scholar
• Beck C. A hybrid approach to scheduling with earliness and tardiness costs. Third International Workshop on Integration of AI and OR Techniques (CPAIOR01) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01Google Scholar
• Benders J. F. Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik (1962) 4:238–252Crossref, Google Scholar
• Bennaceur H., Gouachi I., Plateau G. An incremental branch-and-bound method for the satisfiability problem. INFORMS Journal on Computing (1998) 10:301–308Link, Google Scholar
• Benoist T., Laburthe F., Rottembourg B. Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems. Third International Workshop on Integration of AI and OR Techniques (CPAIOR01) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01Google Scholar
• Berge C.Graphes et hypergraphes (1970) (Dunod, Paris, France) Google Scholar
• Beringer H., De Backer B., Beierle C., Plümer L. Combinatorial problem solving in constraint logic programming with cooperating solvers. Logic Programming: Formal Methods and Practical Applications (1995) (Elsevier/North-Holland, Amsterdam, The Netherlands) 245–272Google Scholar
• Bertele U., Brioschi F.Nonserial Dynamic Programming (1972) (Academic Press, New York) Google Scholar
• Blair C. E., Jeroslow R. G., Lowe J. K. Some results and experiments in programming techniques for propositional logic. Computers and Operations Research (1988) 13:633–645Crossref, Google Scholar
• Bockmayr A., Kasper T. Branch and infer: a unifying framework for integer and finite domain constraint programming. INFORMS Journal on Computing (1998) 10:287–300Link, Google Scholar
• Bollapragada S., Ghattas O., Hooker J. N. Optimal design of truss structures by mixed logical and linear programming. Operations Research (2001) 49:42–51Link, Google Scholar
• Boole G.The Mathematical Analysis of Logic: Being a Essay Toward a Calculus of Deductive Reasoning (1847) (Blackwell, Oxford, U.K., reprinted in 1951) Google Scholar
• Boole G.Studies in Logic and Probability (1952) (R. Rhees, ed. Watts, and Company, London, U.K., and Open Court Publishing Company, La Salle, IL) Google Scholar
• Cagan J., Grossmann I. E., Hooker J. N. A conceptual framework for combining artificial intelligence and optimization in engineering design. Research in Engineering Design (1997) 9:20–34Crossref, Google Scholar
• Caprara A., Focacci F., Lamma E., Mello P., Milano M., Toth P., Vigo D. Integrating constraint logic programming and operations research techniques for the crew rostering problem. Software—Practice and Experience (1998) 28:49–76Crossref, Google Scholar
• Caseau Y., Silverstein G., Laburthe F. Learning hybrid algorithms for vehicle routing problems. Third International Workshop on Integration of AI and OR Techniques (CPAIOR01) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01Google Scholar
• Chandrasekaran R., Pulley-blank W. R. Integer programming problems for which a simple type of rounding algorithm works. Progress in Combinatorial Optimization (1984) (Academic Press, Canada) 101–106Crossref, Google Scholar
• Chandru V., Hooker J. N. Extended Horn sets in propositional logic. Journal of the ACM (1991) 38:205–221Crossref, Google Scholar
• Chandru V., Hooker J. N.Optimization Methods for Logical Inference (1999) (Wiley, New York) Crossref, Google Scholar
• Chhajed D., Lowe T. J. Solving structured multifacility location problems efficiently. Transportation Science (1994) 28:104–115Link, Google Scholar
• Clocksin W. F., Mellish C. S.Programming in Prolog (1984) 2nd ed.(Springer, New York) Crossref, Google Scholar
• Colmerauer A. PROLOG II reference manual and theoretical model. (1982) . Technical report, Groupe Intelligence Artificielle, Université Aix-Marseille II, Aix, FranceGoogle Scholar
• Colmerauer A. Opening the PROLOG-III universe. BYTE Magazine (1987) 12Google Scholar
• Colmerauer A. An introduction to PROLOG-III. Communications of the ACM (1990) 33:69–90Crossref, Google Scholar
• Colmerauer A. Spécifications de Prolog IV. (1996) . Technical report, Laboratoire d′Informatique de Marseille, Université Aix-Marseille II, Aix, FranceGoogle Scholar
• Crama Y., Hansen P., Jaumard and B. The basic algorithm for pseudo-boolean programming revisited. Discrete Applied Mathematics (1990) 29:171–185Crossref, Google Scholar
• Darby-Dowman K., Little J. Properties of some combinatorial optimization problems and their effect on the performance of integer programming and constraint logic programming. INFORMS Journal on Computing (1998) 10:276–286Link, Google Scholar
• Darby-Dowman K., Little J., Mitra G., Zaffalon M. Constraint logic programming and integer programming approaches and their collaboration in solving an assignment scheduling problem. Constraints (1997) 1:245–264Crossref, Google Scholar
• Dechter R. Bucket elimination: a unifying framework for reasoning. Artificial Intelligence (1999) 41:41–85Crossref, Google Scholar
• Dechter R. An anytime approximation for optimizing policies under uncertainty. Workshop on Decision Theoretic Planning, AIPS 2000 (2000) Google Scholar
• Dechter R., Pearl J. Tree-clustering schemes for constraint processing. Proceedings, National Conference on Artificial Intelligence, AAAI (1988) 150–154Google Scholar
• De Farias I. R., Nemhauser E. L. Johnson and G. L. Branch-and-cut for combinatorial optimisation problems without auxiliary binary variables. Knowledge Engineering Review (2001) 16:25–39Crossref, Google Scholar
• Dincbas M., Van Hentenryck P., Simonis H., Aggoun A., Graf T., Bertier F. The constraint programming language CHIP. Proceedings on the International Conference on Fifth Generation Computer Systems (1988) Tokyo, JapanGoogle Scholar
• El Sakkout L., Richards T., Wallace M., Prade H. Minimal perturbance in dynamic scheduling. Proceedings, 13th European Conference on Artificial Intelligence (1998) (Wiley, New York) 504–508Google Scholar
• Eremin A., Wallace and M. Hybrid Benders decomposition algorithms in constraint logic programming. Seventh International Conference on Principles and Practice of Constraint Programming (2001) . CP2001Crossref, Google Scholar
• Focacci F., Lodi A., Milano M. Cost-based domain filtering. Principles and Practice of Constraint Programming. Lecture Notes in Computer Science (1999a) 1713:189–203Crossref, Google Scholar
• Focacci F., Lodi A., Milano M. Solving TSP with time windows with constraints. 16th International Conference on Logic Programming (1999b) Las Cruces, NMGoogle Scholar
• Fortet R. L′algèbre de Boole et ses applications en recherche opérationnelle. Cahiers du centre d′études de recherche opérationnelle (1959) 1:5–36Google Scholar
• Fortet R. Applications de l′algèbre de Boole en recherche opérationnelle. Revue Française d′informatique et de recherche opérationnelle (1960) 1:17–25Google Scholar
• Freuder E. C. A sufficient condition for backtrack-free search. Journal of the ACM (1982) 29:24–32Crossref, Google Scholar
• Garfinkel R., Nemhauser G. Optimal political districting by implicit enumeration techniques. Management Science (1970) 16:B495–Link, Google Scholar
• Gaschnig J. A general backtrack algorithm that eliminates most redundant tests. Proceedings, 5th International Joint Conference on AI (1977) . 457Google Scholar
• Gaschnig J. Experimental studies of backtrack vs. Waltz-type vs. new algorithms for satisficing-assignment problems. Proceedings, 2nd National Conference of the Canadian Society for Computational Studies of Intelligence (1978) 19–21Google Scholar
• Geoffrion A. M. Generalized Benders decomposition. Journal of Optimization Theory and Applications (1972) 10:237–260Crossref, Google Scholar
• Ginsberg M. L. Dynamic backtracking. Journal of Artificial Intelligence Research (1993) 1:25–46Crossref, Google Scholar
• Ginsberg M. L., McAllester D. A. GSAT and dynamic backtracking. Second Workshop on Principles and Practice of Constraint Programming (1994) 216–225Crossref, Google Scholar
• Glover F. Surrogate constraint duality in mathematical programming. Operations Research (1975) 23:434–451Link, Google Scholar
• Gomory R. E. On the relation between integer and noninteger solutions to linear programs. Proceedings of the National Academy of Sciences of the USA (1965) 53:260–265Crossref, Google Scholar
• Granot F., Hammer P. L. On the use of boolean functions in 0-1 programming. Methods of Operations Research (1971) 12:154–184Google Scholar
• Granot F., Hammer P. L. On the role of generalized covering problems. Cahiers du Centre d′Études de Recherche Opérationnelle (1975) 17:277–289Google Scholar
• Grossmann I. E., Hooker J. N., Raman R., Yan H. Logic cuts for processing networks with fixed charges. Computers and Operations Research (1994) 21:265–279Crossref, Google Scholar
• Gurari E., Sudborough I. Improved dynamic programming algorithms for bandwidth minimization and the mincut linear arrangement problem. Journal of Algorithms (1984) 5:531–546Crossref, Google Scholar
• Hailperin T.Boole's Logic and Probability (1976) (Studies in Logic and the Foundations of Mathematics v. 85, North-Holland, Amsterdam, The Netherlands) Google Scholar
• Hailperin T.Boole's Logic and Probability (1986) Second Edition(Studies in Logic and the Foundations of Mathematics v. 85, North-Holland, Amsterdam, The Netherlands) Google Scholar
• Hammer P. L., Hansen P., Simeone B. Roof duality, complementation and persistency in quadratic 0-1 optimization. Mathematical Programming (1984) 28:121–155Crossref, Google Scholar
• Hammer P. L., Peled U. On the maximization of a pseudo-boolean function. Journal of the Association for Computing Machinery (1972) 19:265–282Crossref, Google Scholar
• Hammer P. L., Rosenberg I., Rudeanu S. On the determination of the minima of pseudo-boolean functions (in Romanian). Studii si Cercetari Matematice (1963) 14:359–364Google Scholar
• Hammer P. L., Rudeanu S.Boolean Methods in Operations Research and Related Areas (1968) (Springer, New York) Crossref, Google Scholar
• Hansen P. Un algorithme S.E.P. pour les programmes pseudo-booléens non linéaires. Cahiers du Centre d′Études de Recherche Opérationnelle (1969) 11:26–44Google Scholar
• Hansen P. Un algorithme pour les programmes non linéaires en variables zéro-un. Comptes Rendus de l′Académie des Sciences de Paris (1970) 273:1700–1702Google Scholar
• Hansen P. L., Jaumard B., Mathon V. Constrained nonlinear 0-1 programming. ORSA Journal on Computing (1993) 5:97–119Link, Google Scholar
• Hansen P., Lu S. H., Simeone B. On the equivalence of paved duality and standard linearization in nonlinear 0-1 optimization. Mathematical Programming (1984) 28:121–155Crossref, Google Scholar
• Heipcke S., Prade H. Integrating constraint programming techniques into mathematical programming. Proceedings, 13th European Conference on Artificial Intelligence (1998) (Wiley, New York) 259–260Google Scholar
• Heipcke S. (1999) . Combined modelling and problem solving in mathematical programming and constraint programming, Ph.D. Thesis, Univ. of Buckingham, Buckingham, U. K.Google Scholar
• Hooker J. N. Generalized resolution and cutting planes. Annals of Operations Research (1988) 12:217–239Crossref, Google Scholar
• Hooker J. N. Input proofs and rank one cutting planes. ORSA Journal on Computing (1989) 1:137–145Link, Google Scholar
• Hooker J. N. Generalized resolution for 0-1 linear inequalities. Annals of Mathematics and Artificial Intelligence (1992) 6:271–286Crossref, Google Scholar
• Hooker J. N. Logic-based methods for optimization. A. Borning, Principles and Practice of Constraint Programming. Lecture Notes in Computer Science (1994) 874:336–349Crossref, Google Scholar
• Hooker J. N. Logic-based Benders decomposition. (1995) . INFORMS 1995Google Scholar
• Hooker J. N., Woodruff D. L. Constraint satisfaction methods for generating valid cuts. Advances in Computational and Stochastic Optimization, Logic Programming and Heuristic Search (1997) (Kluwer, Dordrecht, The Netherlands) 1–30Google Scholar
• Hooker J. N.Logic-Based Methods for Optimization: Combining Optimization and Constraint Satisfaction (2000) (Wiley, New York) Crossref, Google Scholar
• Hooker J. N. (2001) . Integrating solution methods for optimization and constraint satisfaction problems. Manuscript, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Hooker J. N., Fedjki C. Branch-and-cut solution of inference problems in propositional logic. Annals of Mathematics and Artificial Intelligence (1990) 1:123–140Crossref, Google Scholar
• Hooker J. N., Kim Hak-Jin, Ottosson G. A declarative modeling framework that combines solution methods. Annals of Operations Research (2001) . ForthcomingCrossref, Google Scholar
• Hooker J. N., Osorio M. A. Mixed logical/linear programming. Discrete Applied Mathematics (1999) 96–97:395–442Crossref, Google Scholar
• Hooker J. N., Ottosson G. Logic-based Benders decomposition. Mathematical Programming (1998) . ForthcomingGoogle Scholar
• Hooker J. N., Ottosson G., Thorsteinsson E., Kim Hak-Jin. On integrating constraint propagation and linear programming for combinatorial optimization. Proceedings, 16th National Conference on Artificial Intelligence (1999) (MIT Press, Cambridge, MA) 136–141Google Scholar
• Hooker J. N., Ottosson G., Thorsteinsson E., Kim Hak-Jin. A scheme for unifying optimization and constraint satisfaction methods. Knowledge Engineering Review (2000) 15:11–30Crossref, Google Scholar
• Hooker J. N., Yan Hong, Saraswat V., Hentenryck P. Van. Logic circuit verification by Benders decomposition. Principles and Practice of Constraint Programming: The Newport Papers (1995) (MIT Press, Cambridge, MA) 267–288Google Scholar
• Hooker J. N., Yan H. A continuous relaxation for the cumulative constraint. (2001) . Manuscript. Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PAGoogle Scholar
• Jaffar J., Lassez J.-L. Constraint logic programming. Proceedings, 14th ACM Symposium on Principles of Programming Languages (1987) (ACM Press, Munich, Germany) 111–119Crossref, Google Scholar
• Jaffar J., Michaylov S., Lassez J.-L. Methodology and implementation of a CLP system. Logic Programming: Proceedings, 4th International Conference (1987) (MIT Press, Cambridge, MA) 196–218Google Scholar
• Jaffar J., Michaylov S., Stuckey P., Yap R. The CLP(ℛ) language and system. ACM Transactions of Programming Languages and Systems (1992) 14:339–395Crossref, Google Scholar
• Jaffar J., Stuckey P. Semantics of infinite tree logic programming. Theoretical Computer Science (1986) 42:141–158Crossref, Google Scholar
• Jain V., Grossmann I. E. Algorithms for hybrid MILP/CLP models for a class of optimization problems. INFORMS Journal on Computing (2001) 13:258–276Link, Google Scholar
• Jeroslow R. E. Representability in mixed integer programming, I: characterization results. Discrete Applied Mathematics (1987) 17:223–243Crossref, Google Scholar
• Jeroslow R. E.Logic-Based Decision Support: Mixed Integer Model Formulation. Annals of Discrete Mathematics (1989) 40(North-Holland, Amsterdam, The Netherlands) Google Scholar
• Jeroslow R. E., Martin R. K., Rardin R. L., Wang J. Gain-free Leontief flow problems. (1989) . Manuscript, Graduate School of Business, University of Chicago, Chicago, ILGoogle Scholar
• Jeroslow R. G., Wang J. Dynamic programming, integral polyhedra and Horn clause knowledge base. ORSA Journal on Computing (1989) 4:7–19Link, Google Scholar
• Junker U., Karisch S. E., Kohl N., Vaaben B., Fahle T., Sellmann M., Jaffar J. A framework for constraint programming based column generation. Principles and Practice of Constraint Programming (1999) 1713(Springer, Berlin, Germany) 261–274Lecture Notes in Computer ScienceGoogle Scholar
• Kim Hak-Jin, Hooker J. N. Solving fixed-charge network flow problems with a hybrid optimization and constraint programming approach. Annals of Operations Research (2001) . ForthcomingGoogle Scholar
• Kowalski R.Logic for Problem Solving (1979) (Elsevier North-Holland, New York) Google Scholar
• Lau H. C., Liu Q. Z. Collaborative model and algorithms for supporting real-time distribution logistics systems. CP99 Post-Conference Workshop on Large Scale Combinatorial Optimization and Constraints (1999) 30–44 http://www.dash.co.uk/wscp99Google Scholar
• Laundy R. S. Logically constrained mathematical programming problems. (1986) . Ph.D. thesis, University of Southampton, Southampton, U.KGoogle Scholar
• Lauritzen S. L., Spiegelhalter D. J. Local computations with probabilities on graphical structures and their application to expert systems. Journal of the Royal Statistical Society B (1988) 50:157–224Google Scholar
• Lauvergne M., David P., Boizumault P. Resource allocation in ATM networks: a hybrid approach. Third International Workshop on the Integration of AI and OR Techniques (CPAIOR 2001) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01/Google Scholar
• Little J., Darby-Dowman K., Lawrence M., Wilson C. The significance of constraint logic programming to operational research. Operational Research (1995) 20–45Google Scholar
• Lloyd W.Foundations of Logic Programming (1984) (Springer, New York) Crossref, Google Scholar
• Lu S. H., Williams A. C. Roof duality for polynomial 0-1 optimization. Mathematical Programming (1987) 37:357–360Crossref, Google Scholar
• Marriott K., Stuckey P. J.Programming with Constraints: An Introduction (1998) (MIT Press, Cambridge, MA) Crossref, Google Scholar
• McAllester D. A. (1993) . Partial order backtracking. Manuscript, AI Laboratory, Massachusetts Institute of Technology, Cambridge, MAGoogle Scholar
• McAloon K., Tretkoff C.Optimization and Computational Logic (1996) (Wiley, New York) . The system 2LP is http://www.sci.brooklyn.cuny.edu/~lbslab/doc_lplp.htmlGoogle Scholar
• Oplobedu A., Marcovitch J., Tourbier Y. Charme: un langage industriel de programmation par constraintes, illustré par une application chez renault. Ninth International Workshop on Expert Systems and Their Applications: General Conference (1989) 1:55–70Google Scholar
• Osorio M. A., Glover F. Logic cuts using surrogate constraint analysis in the multidimensional knapsack problem. Third International Workshop on Integration of AI and OR Techniques (CPAIOR01) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01Google Scholar
• Osorio M. A., Hooker J. N.General Mixed Logical/Linear Solver (1996) (INFORMS, Washington, D.C) Google Scholar
• Ottosson G., Thorsteinsson E. Linear relaxations and reduced-cost based propagation of continuous variable subscripts. Second International Workshop on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2000) University of Paderborn, Paderborn, GermanyGoogle Scholar
• Ottosson G., Thorsteinsson E., Hooker J. N. Mixed global constraints and inference in hybrid CLP-IP solvers. CP99 Post-Conference Workshop on Large Scale Combinatorial Optimization and Constraints (1999) 57–78 http://www.dash.co.uk/wscp99Google Scholar
• Partouche A. Planification d′horaires de travail. (1998) . Ph.D. thesis, Université Paris-Daphiné, U. F. R. Sciences des Organisations, Paris, FranceGoogle Scholar
• Pinto J. M., Grossmann I. E. A logic-based approach to scheduling problems with resource constraints. Computers and Chemical Engineering (1997) 21:801–818Crossref, Google Scholar
• Puget J.-F. PECOS: a high-level constraint programming language. Proceedings, SPICIS'92 (1992) SingaporeGoogle Scholar
• Puget J.-F. A C++ implementation of CLP. Proceedings of SPI-CIS'94 (1994) SingaporeGoogle Scholar
• Puget J.-F., Leconte M., Lloyd J. Beyond the black box: constraints as objects. Logic Programming: Proceedings, 1988 Joint International Conference and Symposium (1995) (MIT Press, Cambridge, MA) 140–159Google Scholar
• Puget J.-F., Lustig I. Constraint programming and math programming. (1999) . Manuscript, ILOG S. A., Gentilly, FranceGoogle Scholar
• Quine W. V. The problem of simplifying truth functions. American Mathematical Monthly (1952) 59:521–531Crossref, Google Scholar
• Quine W. V. A way to simplify truth functions. American Mathematical Monthly (1955) 62:627–631Crossref, Google Scholar
• Raman R., Grossmann I. Symbolic integration of logic in min mixed-integer linear programming techniques for process synthesis. Computers and Chemical Engineering (1991) 17:909–927Crossref, Google Scholar
• Raman R., Grossmann I. Relation between MILP modeling and logical inference for chemical process synthesis. Computers and Chemical Engineering (1993) 15:73–84Crossref, Google Scholar
• Raman R., Grossmann I. Modeling and computational techniques for logic based integer programming. Computers and Chemical Engineering (1994) 18:563–578Crossref, Google Scholar
• Réfalo P. Tight cooperation and its application in piecewise linear optimization. J. Jaffar, Principles and Practice of Constraint Programming. Lecture Notes in Computer Science (1999) 1713(Springer, Berlin, Germany) 373–389Google Scholar
• Régin J.-C. A filtering algorithm for constraints of difference in CSPs. Proceedings, National Conference on Artificial Intelligence (1994) 362–367Google Scholar
• Rodošek R., Wallace M. A generic model and hybrid algorithm for hoist scheduling problems. Principles and Practice of Constraint Programming (CP-98). Lecture Notes in Computer Science (1998) 1520(Springer, Berlin, Germany) 385–399Crossref, Google Scholar
• Rodošek R., Wallace M., Hajian M. A new approach to integrating mixed integer programming and constraint logic programming. Annals of Operations Research (1997) 86:63–87Crossref, Google Scholar
• Saxe J. Dynamic programming algorithms for recognizing small bandwidth graphs in polynomial time. SIAM Journal on Algebraic and Discrete Methods (1980) 1:363–369Crossref, Google Scholar
• Schaefer T. J. The complexity of satisfiability problems. Proceedings, 10th ACM Symposium on Theory of Computing (1978) 216–226Crossref, Google Scholar
• Schlipf J. S., Annexstein F. S., Franco J. V., Swaminathan R. P. On finding solutions for extended Horn formulas. Information Processing Letters (1995) 54:133–137Crossref, Google Scholar
• Sellmann M., Fahle T. CP-based Lagrangian relaxation for a multimedia application. Third International Workshop on the Integration of AI and OR Techniques (CPAIOR 2001) (2001) . http://www-icparc.doc.ic.ac.uk/cpAIOR01/Google Scholar
• Shafer G., Shenoy P. P., Mellouli K. Propagating belief functions in qualitative Markov trees. International Journal of Approximate Reasoning (1987) 1:349–400Crossref, Google Scholar
• Smith B. M., Brailsford S. C., Hubbard P. M., Williams H. P. The progressive party problem: integer linear programming and constraint programming compared. Constraints (1996) 1:119–138Crossref, Google Scholar
• Solnon C. Coopération de solveurs linéaires sur les réels pour la résolution de problèmes linéaires en nombres entiers. Journées Francophones de la programmation logique par contraintes (1997) (Hermes, Orléans, France) Google Scholar
• Sterling L., Shapiro E.The Art of Prolog: Advanced Programming Techniques (1986) (MIT Press, Cambridge, MA) Google Scholar
• Thorsteinsson E. S. Branch-and-check: a hybrid framework integrating mixed integer programming and constraint logic programming. Seventh International Conference on Principles and Practice of Constraint Programming (CP2001) (2001) Crossref, Google Scholar
• Tsang E.Foundations of Constraint Satisfaction (1993) (Academic Press, London, U.K) Google Scholar
• Türkay M., Grossmann I. E. Logic-based MINLP algorithms for the optimal synthesis of process networks. Computers and Chemical Engineering (1996) 20:959–978Crossref, Google Scholar
• Van Hentenryck P.Constraint Satisfaction in Logic Programming (1989) (MIT Press, Cambridge) Google Scholar
• Van Hentenryck P., Lustig I.The OPL Optimization Programming Language (1999) (MIT Press, Cambridge, MA) Google Scholar
• Van Hentenryck P., Michel L. Newton: constraint programming over nonlinear real constraints. (1997) . Technical Report CS-95-25, Computer Science Department, Brown University, Providence, RIGoogle Scholar
• Van Hentenryck P., Michel L., Benhamou F. Newton: constraint programming over nonlinear constraints. Science of Computer Programming (1998) 30:83–118Crossref, Google Scholar
• Wallace M., Novello S., Schimpf J. ECLiPSe: a platform for constraint logic programming. ICL Systems Journal (1997) 12:159–200Google Scholar
• Williams H. P. Fourier-Motzkin elimination extension to integer programming problems. Journal of Combinatorial Theory (1976) 21:118–123Crossref, Google Scholar
• Williams H. P. Logical problems and integer programming. Bulletin of the Institute of Mathematics and its Implications (1977) 13:18–20Google Scholar
• Williams H. P. Linear and integer programming applied to the propositional calculus. International Journal of Systems Research and Information Science (1987) 2:81–100Google Scholar
• Williams H. P. Computational logic and integer programming: Connections between the methods of logic, AI and OR. (1991) . Technical Report, University of Southampton, Southampton, U.KGoogle Scholar
• Williams H. P. Logic applied to integer programming and integer programming applied to logic. European Journal of Operational Research (1995) 81:605–616Crossref, Google Scholar
• Williams H. P., Yan Hong. Representations of the all-different predicate. INFORMS Journal on Computing (2001) . ForthcomingGoogle Scholar
• Williams H. P., Yan Hong. Convex hull representations of the at-least predicate of constraint satisfaction. (2001a) . Manuscript, Operational Research Department, London School of EconomicsGoogle Scholar
• Williams H. P., Wilson J. M. Connections between integer linear programming and constraint logic programming-an overview and introduction to the cluster of articles. INFORMS Journal on Computing (1998) 10:261–264Link, Google Scholar
• Wilson J. M. Compact normal forms in propositional logic and integer programming formulations. Computers and Operations Research (1990) 90:309–314Crossref, Google Scholar
• Wilson J. M. Problem specification in constraint logic programming and integer programming. (1995) . Working paper 1995:32, Loughborough University Business School Research Series, Loughborough, U.KGoogle Scholar
• Wilson J. M. A note on logic cuts and valid inequalities for certain standard (0-1) integer programs. JORBEL (1996) 36:27–41Google Scholar
• Wolsey L. A.Integer Programming (1998) (Wiley, New York) Google Scholar
• Yan H., Hooker J. N. Tight representation of logical constraints as cardinality rules. Mathematical Programming (1999) 85:363–377Crossref, Google Scholar
• Zabih R. Some applications of graph bandwidth to constraint satisfaction problems. Proceedings, National Conference on Artificial Intelligence (1990) 46–51Google Scholar