Hostname: page-component-7c8c6479df-p566r Total loading time: 0 Render date: 2024-03-28T23:12:44.875Z Has data issue: false hasContentIssue false

A scheme for unifying optimization and constraint satisfaction methods

Published online by Cambridge University Press:  06 March 2012

JOHN HOOKER
Affiliation:
Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213, USA
GREGER OTTOSSON
Affiliation:
Department of Information Technology, Computing Science, Uppsala University, Box 311, S-751 05 Uppsala, Sweden
ERLENDER S. THORSTEINSSON
Affiliation:
Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213, USA
HAK-JIN KIM
Affiliation:
Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA 15213, USA

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.

Type
Review Article
Copyright
© 2000 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)