• Home
  • Search
  • Global Constraints in Distributed Constraint Satisfaction and Optimization
  • Open Access IconOpen Access
  • Cite Icon9
  • https://doi.org/10.1093/comjnl/bxt088Copy DOI Icon

Global Constraints in Distributed Constraint Satisfaction and Optimization

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Global constraints are an essential component in the efficiency of centralized constraint programming. We propose to include global constraints in distributed constraint satisfaction and optimization problems (DisCSPs and DCOPs). We detail how this inclusion can be done, considering different representations for global constraints (direct, nested, binary). We explore the relation of global constraints with local consistency (both in the hard and soft cases), in particular for generalized arc consistency (GAC). We provide experimental evidence of the benefits of global constraints on several benchmarks, both for distributed constraint satisfaction and for distributed constraint optimization.

Similar Papers
  • Conference Article
  • Citations60

Approximating CSPs with Global Cardinality Constraints Using SDP Hierarchies

  • Jan 17, 2012
  • Prasad Raghavendra +1
  • Book Chapter
  • Citations7

Distributed Constraint Programming with Agents

  • Jan 01, 2011
  • Carl Christian Rolf +1
  • Single Book
  • Citations1457

Handbook of Constraint Programming

  • Jan 01, 2006
  • Francesca Rossi +2
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Conference Article
  • Citations1

Constraint Solving and Optimization Using Evolutionary Techniques

  • Aug 01, 2019
  • Mahdi Bidar +1
  • Research Article
  • Citations2

Weight-based Heuristics for Constraint Satisfaction and Combinatorial Optimization Problems

  • Feb 16, 2012
  • Journal of Mathematical Modelling and Algorithms
  • Marie-José Huguet +2
  • Book Chapter
  • Citations4

Generalizing Global Constraints Based on Network Flows

  • Jan 01, 2008
  • Igor Razgon +2
  • Research Article
  • Citations9

An Efficient Higher-Order Consistency Algorithm for Table Constraints

  • Sep 20, 2021
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Anastasia Paparrizou +1
  • Research Article
  • Citations3

A learning Portfolio solver for optimizing the performance of constraint programming problems on multi‐core computing systems

  • Apr 27, 2016
  • Concurrency and Computation: Practice and Experience
  • Tarek Menouer +2
  • Research Article
  • Citations17

Extending STR to a Higher-Order Consistency

  • Jun 30, 2013
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Christophe Lecoutre +2
  • Research Article
  • Citations2

The Expressive Power of Ad-Hoc Constraints for Modelling CSPs

  • Jun 26, 2023
  • Proceedings of the AAAI Conference on Artificial Intelligence
  • Ruiwei Wang +1
  • Book Chapter
  • Citations2

Autonomous Search in Constraint Satisfaction via Black Hole: A Performance Evaluation Using Different Choice Functions

  • Jan 01, 2016
  • Ricardo Soto +4
  • Conference Article
  • Citations1

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 07, 2001
  • M Tounsi +1
  • Research Article

Distributed Constraint Optimization

  • Jan 01, 2011
  • Infoscience (Ecole Polytechnique Fédérale de Lausanne)
  • Thomas Léauté
  • Research Article
  • Citations150

Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

  • Jan 01, 2000
  • Constraints
  • Hani El Sakkout +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.