Current Approaches for Solving Over-Constrained Problems

  • Authors:
  • Pedro Meseguer;Noureddine Bouhmala;Taoufik Bouzoubaa;Morten Irgens;Martí Sánchez

  • Affiliations:
  • IIIA-CSIC Campus UAB, 08193 Bellaterra, Spain pedro@iiia.csic.es;Vesfold University College, N-3103 Tønsberg, Norway noureddine.bouhmala@hive.no;SGTM-TreeDAlgo 23 rue Massena, 20100 Casablanca, Maroc tbo@treedalgo.co.ma;SINTEF Postboks 124 Blindern, N-0314 Oslo, Norway morten.irgens@sintef.no;IIIA-CSIC Campus UAB, 08193 Bellaterra, Spain marti@iiia.csic.es

  • Venue:
  • Constraints
  • Year:
  • 2003

Quantified Score

Hi-index 0.00

Visualization

Abstract

We summarize existing approaches to model and solve overconstrained problems. These problems are usually formulated as combinatorial optimization problems, and different specific and generic formalisms are discussed, including the special case of multi-objective optimization. Regarding solving methods, both systematic and local search approaches are considered. Finally we review a number of case studies on overconstrained problems taken from the specialized literature.