An Efficient Library for Solving CSP with Local Search

Philippe Codognet; Daniel Diaz

Conference Papers Year : 2003

An Efficient Library for Solving CSP with Local Search

(1) , (2)

1
2

Philippe Codognet

Function : Author

Objets et Agents pour Systèmes d'Information et Simulation

Daniel Diaz

Function : Author
PersonId : 177531
IdHAL : daniel-diaz
ORCID : 0000-0002-2700-2271
IdRef : 069722358

Centre de Recherche en Informatique de Paris 1

CV

Keywords

local search CSP adaptive search

Domains

Computer Science [cs] Discrete Mathematics [cs.DM] Computer Science [cs] Programming Languages [cs.PL]

Daniel Diaz : Connect in order to contact the contributor

https://hal-paris1.archives-ouvertes.fr/hal-00693282

Submitted on : Wednesday, May 2, 2012-12:14:57 PM

Last modification on : Wednesday, February 8, 2023-5:10:51 PM

Dates and versions

hal-00693282 , version 1 (02-05-2012)

Identifiers

HAL Id : hal-00693282 , version 1

Cite

Philippe Codognet, Daniel Diaz. An Efficient Library for Solving CSP with Local Search. International Conference on Metaheuristics, 2003, Kyoto, Japan. ⟨hal-00693282⟩

An Efficient Library for Solving CSP with Local Search

Keywords

Domains

Dates and versions

Identifiers

Cite

Export

Collections

Share