• Home
  • Search
  • SUCCESSIVE SEARCH METHOD FOR SOLVING VALUED CONSTRAINT SATISFACTION AND OPTIMIZATION PROBLEMS
  • Cite Icon1
  • https://doi.org/10.1142/s0218213002000964Copy DOI Icon

SUCCESSIVE SEARCH METHOD FOR SOLVING VALUED CONSTRAINT SATISFACTION AND OPTIMIZATION PROBLEMS

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 kfRDS; the second one, kvRDS, where k can be variable. Finally, we show that our method improves RDS on daily management of an earth observation satellite.

Similar Papers
  • Conference Article
  • Citations1

Successive search method for valued constraint satisfaction and optimization problems

  • Nov 07, 2001
  • M Tounsi +1
  • 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

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
  • 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
  • Citations6

Time Complexity of Constraint Satisfaction via Universal Algebra

  • Jan 01, 2020
  • Peter Jönsson +2
  • Conference Article

A new approach to optimal energy management with discrete control

  • Jul 01, 2012
  • P Balaguer +3
  • Conference Article
  • Citations18

On Complexity Reduction of the LP Bound Computation and Related Problems

  • Jul 01, 2011
  • Satyajit Thakor +2
  • Book Chapter
  • Citations13

A Cascadable VLSI Design for GENET

  • Jan 01, 1994
  • Chang J. Wang +1
  • PDF
  • Research Article
  • Citations1

Using cooperative coevolution in large-scale black-box constraint satisfaction problems

  • Jan 01, 2024
  • ITM Web of Conferences
  • Aleksei Vakhnin +1
  • Conference Article

Decomposing Constraint Satisfaction Problems by Means of Meta Constraint Satisfaction Optimization Problems

  • Jan 01, 2019
  • Sven Löffler +2
  • Research Article
  • Citations5

Efficient method to obtain the entire active area against circuit delay time trade-off curve in gate sizing

  • Jan 01, 2005
  • IEE Proceedings - Circuits, Devices and Systems
  • J.A Montiel-Nelson +4
  • Book Chapter

Chapter 7 - Exploitation of problem-specific features

  • Jan 01, 1993
  • Foundations of Constraint Satisfaction
  • Edward Tsang
  • Research Article
  • Citations60

Constructing an asymptotic phase transition in random binary constraint satisfaction problems

  • Aug 01, 2001
  • Theoretical Computer Science
  • Barbara M Smith
  • Research Article
  • Citations2

State-Variable Modeling for a Class of Two-Stage Stochastic Optimization Problems

  • Jul 23, 2021
  • INFORMS Journal on Computing
  • Hossein Hashemi Doulabi +2
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.