Solving WCSP by Extraction of Minimal Unsatisfiable Cores

Lecoutre, Christophe; Paris, Nicolas; Roussel, Olivier; Tabary, Sébastien

doi:10.1109/ictai.2013.140

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2016

2023

Publication Types

Select...

Article2

Other1

Relationship

Self Cite0

Independent3

Authors

Journals

Cited by 3 publications

(2 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Costs from different constraints are aggregated with a domain dependent operator. This case is known as the Weighted Constraint satisfaction problems (WCSPs) [15][16] [21]. This latter is an extension of the CSP problem.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Solving the Weighted Constraint Satisfaction Problems Via the Neural Network Approach

Haddouch¹,

Elmoutaoukil²,

Ettaouil³

2016

IJIMAI

View full text Add to dashboard Cite

-A wide variety of real world optimization problems can be modelled as Weighted Constraint Satisfaction Problems (WCSPs). In this paper, we model this problem in terms of in original 0-1 quadratic programming subject to leaner constraints. View it performance, we use the continuous Hopfield network to solve the obtained model basing on original energy function. To validate our model, we solve several instance of benchmarking WCSP. In this regard, our approach recognizes the optimal solution of the said instances.

show abstract

mentioning

confidence: 99%

“…In the literature, a number of different approaches have been developed to solve this problem [7]- [9]- [10]- [14]- [15]. In this work we propose a new model of WCSP problem consists in minimizing the quadratic objective function subject to linear constraints (QP).…”

mentioning

confidence: 99%