Search
2000 Volume 15
Article Contents
RESEARCH ARTICLE   Open Access    

A scheme for unifying optimization and constraint satisfaction methods

More Information
  • Optimization and constraint satisfaction methods are complementary to a large extent, and there has been much recent interest in combining them. Yet no generally accepted principle or scheme for their merger has evolved. We propose a scheme based on two fundamental dualities: the duality of search and inference, and the duality of strengthening and relaxation. Optimization as well as constraint satisfaction methods can be seen as exploiting these dualities in their respective ways. Our proposal is that rather than employ either type of method exclusively, one can focus on how these dualities can be exploited in a given problem class. The resulting algorithm is likely to contain elements from both optimization and constraint satisfaction, and perhaps new methods that belong to neither.
  • 加载中
  • Cite this article

    JOHN HOOKER, GREGER OTTOSSON, ERLENDER S. THORSTEINSSON, HAK-JIN KIM. 2000. A scheme for unifying optimization and constraint satisfaction methods. The Knowledge Engineering Review 15(1)11−30, doi: 10.1017/S0269888900001077
    JOHN HOOKER, GREGER OTTOSSON, ERLENDER S. THORSTEINSSON, HAK-JIN KIM. 2000. A scheme for unifying optimization and constraint satisfaction methods. The Knowledge Engineering Review 15(1)11−30, doi: 10.1017/S0269888900001077

Article Metrics

Article views(8) PDF downloads(86)

RESEARCH ARTICLE   Open Access    

A scheme for unifying optimization and constraint satisfaction methods

The Knowledge Engineering Review  15 2000, 15(1): 11−30  |  Cite this article

Abstract: Optimization and constraint satisfaction methods are complementary to a large extent, and there has been much recent interest in combining them. Yet no generally accepted principle or scheme for their merger has evolved. We propose a scheme based on two fundamental dualities: the duality of search and inference, and the duality of strengthening and relaxation. Optimization as well as constraint satisfaction methods can be seen as exploiting these dualities in their respective ways. Our proposal is that rather than employ either type of method exclusively, one can focus on how these dualities can be exploited in a given problem class. The resulting algorithm is likely to contain elements from both optimization and constraint satisfaction, and perhaps new methods that belong to neither.

    • © 2000 Cambridge University Press
  • About this article
    Cite this article
    JOHN HOOKER, GREGER OTTOSSON, ERLENDER S. THORSTEINSSON, HAK-JIN KIM. 2000. A scheme for unifying optimization and constraint satisfaction methods. The Knowledge Engineering Review 15(1)11−30, doi: 10.1017/S0269888900001077
    JOHN HOOKER, GREGER OTTOSSON, ERLENDER S. THORSTEINSSON, HAK-JIN KIM. 2000. A scheme for unifying optimization and constraint satisfaction methods. The Knowledge Engineering Review 15(1)11−30, doi: 10.1017/S0269888900001077
  • Catalog

      /

      DownLoad:  Full-Size Img  PowerPoint
      Return
      Return