- -

Constraint Satisfaction for Planning and Scheduling Problems

RiuNet: Institutional repository of the Polithecnic University of Valencia

Share/Send to

Cited by

Statistics

Constraint Satisfaction for Planning and Scheduling Problems

Show full item record

Bartak, R.; Salido, MA. (2011). Constraint Satisfaction for Planning and Scheduling Problems. Constraints. 16(3):223-227. doi:10.1007/s10601-011-9109-4

Por favor, use este identificador para citar o enlazar este ítem: http://hdl.handle.net/10251/69066

Files in this item

Item Metadata

Title: Constraint Satisfaction for Planning and Scheduling Problems
Author:
UPV Unit: Universitat Politècnica de València. Departamento de Sistemas Informáticos y Computación - Departament de Sistemes Informàtics i Computació
Issued date:
Abstract:
The areas of planning and scheduling (from the Artificial Intelligence point of view) have seen important advances thanks to application of constraint satisfaction techniques. Currently, many important real-world problems ...[+]
Subjects: Constraint programming , Planning , Scheduling , Search , Complex problems , Constraint handling , Constraint Satisfaction , Constraint satisfaction techniques , Extended versions , Plan synthesis , Planning and scheduling , Real-world problem , Satisfaction problem , State-dependent , Artificial intelligence , Computer programming , Constraint theory , Resource allocation
Copyrigths: Cerrado
Source:
Constraints. (issn: 1383-7133 ) (eissn: 1572-9354 )
DOI: 10.1007/s10601-011-9109-4
Publisher:
Springer Verlag (Germany)
Publisher version: http://dx.doi.org/10.1007/s10601-011-9109-4
Type: Artículo

This item appears in the following Collection(s)

Show full item record