Object oriented modeling of resource assignment problems formulated as CSPs

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 industry, commer...

Descripción completa

Guardado en:
Detalles Bibliográficos
Autores principales: Rueda, Luis G., Arias, Ivanna, Ibáñez, Francisco S., Forradellas Martinez, Raymundo Quilez
Formato: Objeto de conferencia
Lenguaje:Español
Publicado: 1997
Materias:
Ciencias Informáticas
Object Oriented Modeling
Resource Assignment
CSP
SOFTWARE ENGINEERING
base de datos
Acceso en línea:http://sedici.unlp.edu.ar/handle/10915/23960
Aporte de:
SEDICI (UNLP) de Universidad Nacional de La Plata

Ejemplares similares

Ejemplares similares