✦ LIBER ✦

Solving set-valued constraint satisfaction problems

✍ Scribed by Luc Jaulin

Publisher: Springer Vienna
Year: 2011
Tongue: English
Weight: 403 KB
Volume: 94
Category: Article
ISSN: 0010-485X
DOI: 10.1007/s00607-011-0169-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving partial constraint satisfaction

Solving partial constraint satisfaction problems with tree decomposition

✍ Arie M. C. A. Koster; Stan P. M. van Hoesel; Antoon W. J. Kolen 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 166 KB

Nogood-FC for solving partitionable cons

Nogood-FC for solving partitionable constraint satisfaction problems

✍ Montserrat Abril; Miguel A. Salido; Federico Barber 📂 Article 📅 2008 🏛 Springer US 🌐 English ⚖ 837 KB

Musical constraint satisfaction problems

Musical constraint satisfaction problems solved with adaptive search

✍ C. Truchet; P. Codognet 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 244 KB

Learning cluster-based structure to solv

Learning cluster-based structure to solve constraint satisfaction problems

✍ Xingjian Li; Susan L. Epstein 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 804 KB

Interval-valued soft constraint problems

✍ Mirco Gelain; Maria Silvia Pini; Francesca Rossi; Kristen Brent Venable; Nic Wil 📂 Article 📅 2010 🏛 Springer Netherlands 🌐 English ⚖ 619 KB

Generalized Constraint Qualifications an

Generalized Constraint Qualifications and Optimality Conditions for Set-Valued Optimization Problems

✍ Huang Yong-Wei 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 106 KB

In this paper we discuss the connections of four generalized constraint qualifications for set-valued vector optimization problems with constraints. Then some K-T type necessary and sufficient optimality conditions are derived, in terms of the contingent epiderivatives.