1.
|
Object oriented modeling of resource assignment problems formulated as CSPs
Rueda, Luis G. - Arias, Ivanna - Ibáñez, Francisco S. - Forradellas Martinez, Raymundo Quilez
Formato: |
Objeto de conferencia, Objeto de conferencia |
Enlaces: |
Discrete combinatorial problems can be solved with Constraint Programming (CP) as long as they are formulated as Constraint Satisfaction Problems (CSP). In this paper we propose an object oriented model to solve combinatorial problems of resource assignment including applications in…
|
Fecha: |
2012-11-09 |
Recurso: |
Unversidad Nacional de La Plata |
|