Completable Partial solutions in constraint programming and constraint-based scheduling
Kovács, A. and Váncza, József (2004) Completable Partial solutions in constraint programming and constraint-based scheduling. LECTURE NOTES IN COMPUTER SCIENCE, 3258. pp. 332-346.
Full text not available from this repository.Item Type: | Article |
---|---|
Subjects: | Q Science > QA Mathematics and Computer Science > QA75 Electronic computers. Computer science / számítástechnika, számítógéptudomány |
Divisions: | Research Laboratory on Engineering & Management Intelligence |
Depositing User: | Eszter Nagy |
Date Deposited: | 11 Dec 2012 15:16 |
Last Modified: | 11 Dec 2012 15:16 |
URI: | https://eprints.sztaki.hu/id/eprint/3662 |
Update Item |