A Framework for Integrating Optimization and Constraint Programming

  • John N. Hooker
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4612)


This talk begins with a description of the modeling and computational advantages that can be obtained by combining optimization and constraint programming in a principled way. It then presents a framework for integration based on three elements: a search-infer-and-relax algorithmic paradigm, a unifying theory of duality, and the use of metaconstraints (a generalization of global constraints) for modeling. Inference techniques from constraint programming and relaxation techniques from mathematical programming are combined in both branch-and-relax search and constraint-based (nogood-based) search. The talk illustrates these ideas with examples in freight shipment, employee scheduling, continuous global optimization, airline crew scheduling, the propositional satisfiability problem, and multiple machine scheduling.


Global Optimization Mathematical Logic Mathematical Programming Unify Theory Formal Language 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© Springer-Verlag Berlin Heidelberg 2007

Authors and Affiliations

  • John N. Hooker
    • 1
  1. 1.Carnegie Mellon UniversityUSA

Personalised recommendations