✦ LIBER ✦

An explanation-based tools for debugging constraint satisfaction problems

✍ Scribed by Samir Ouis; Mohamed Tounsi

Publisher: Elsevier Science
Year: 2008
Tongue: English
Weight: 178 KB
Volume: 8
Category: Article
ISSN: 1568-4946
DOI: 10.1016/j.asoc.2007.10.019

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Backjump-based backtracking for constrai

Backjump-based backtracking for constraint satisfaction problems

✍ Rina Dechter; Daniel Frost 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 385 KB

The performance of backtracking algorithms for solving finite-domain constraint satisfaction problems can be improved substantially by look-back and look-ahead methods. Look-back techniques extract information by analyzing failing search paths that are terminated by dead-ends. Look-ahead techniques

An exact algorithm for the constraint sa

An exact algorithm for the constraint satisfaction problem: Application to logical inference

✍ Hachemi Bennaceur; Gérard Plateau 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 590 KB

An efficient DCOC algorithm based on hig

An efficient DCOC algorithm based on high-quality approximations for problems including eigenvalue constraints

✍ M. Zhou 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 780 KB

Comments on “An improved model for vehic

Comments on “An improved model for vehicle routing problem with time constraint based on genetic algorithm” [Comput. Ind. Eng. 42 (2002) 361–369]

✍ Hong-Tao Lei; Bo Guo 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 131 KB

An improved model for vehicle routing problem proposed by was recently published in Computer & Industrial Engineering Journal to solve the time constraint vehicle routing problem based on improved genetic algorithm. In this work, comments are given to the published paper of . And they centralize on