• Home
  • Search
  • Successive search method for valued constraint satisfaction and optimization problems
  • Cite Icon1
  • https://doi.org/10.1109/ictai.2001.974482Copy DOI Icon

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 7, 2001
  • M Tounsi +1 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

In this paper we introduce a new method based on Russian Doll Search (RDS) for solving optimization problems expressed as Valued Constraint Satisfaction Problems (VCSPs). The RDS method solves problems of size n (where n is the number of variables) by replacing one search by n successive searches on nested subproblems using the results of each search to produce a better lower bound. The main idea of our method is to introduce the variables through the successive searches not one by one but by sets of k variables. We present two variants of our method: the first one where the number k is fixed, noted k/sub f/RDS; the second one, k/sub u/RDS, where k can be variable. Finally, we show that our method improves RDS on daily management of an earth observation satellite.

Similar Papers
  • Research Article
  • Citations1

SUCCESSIVE SEARCH METHOD FOR SOLVING VALUED CONSTRAINT SATISFACTION AND OPTIMIZATION PROBLEMS

  • Sep 01, 2002
  • International Journal on Artificial Intelligence Tools
  • Mohamed Tounsi +1
  • Research Article

Message Passing Algorithms for Semiring-Based and Valued Constraint Satisfaction Problems

  • Sep 01, 2021
  • Proceedings of the International Symposium on Combinatorial Search
  • Hong Xu +3
  • Research Article
  • Citations1

Piecewise Linear Valued CSPs Solvable by Linear Programming Relaxation

  • Nov 22, 2021
  • ACM Transactions on Computational Logic
  • Manuel Bodirsky +2
  • Research Article
  • Citations11

An Iterative local-search framework for solving constraint satisfaction problem

  • Jan 05, 2008
  • Applied Soft Computing Journal
  • Mohamed Tounsi +1
  • Book Chapter
  • Citations13

A Cascadable VLSI Design for GENET

  • Jan 01, 1994
  • Chang J. Wang +1
  • Conference Article
  • Citations6

Time Complexity of Constraint Satisfaction via Universal Algebra

  • Jan 01, 2020
  • Peter Jönsson +2
  • 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
  • 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
  • Citations9

Global Constraints in Distributed Constraint Satisfaction and Optimization

  • Aug 30, 2013
  • The Computer Journal
  • C Bessiere +3
  • Book Chapter
  • Citations15

The Complexity of Valued CSPs

  • Jan 01, 2017
  • DROPS (Schloss Dagstuhl – Leibniz Center for Informatics)
  • Andrei Krokhin +1
  • Research Article
  • Citations24

Classes of submodular constraints expressible by graph cuts

  • Sep 24, 2009
  • Constraints
  • Stanislav Živný +1
  • Conference Article
  • Citations8

Optimizing Constraint Solving via Dynamic Programming

  • Aug 01, 2019
  • Shu Lin +2
  • Research Article
  • Citations150

Probe Backtrack Search for Minimal Perturbation in DynamicScheduling

  • Jan 01, 2000
  • Constraints
  • Hani El Sakkout +1
  • Book Chapter
  • Citations25

Portfolio Approaches for Constraint Optimization Problems

  • Jan 01, 2014
  • Roberto Amadini +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.