Finite Domain Constraint Programming in Oz -- A Tutorial (1998)
by
Christian Schulte
,
Gert Smolka
,
Jörg Würtz
| Venue: | PROGRAMMING SYSTEMS LAB, GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE (DFKI |
| Citations: | 30 - 3 self |
BibTeX
@INPROCEEDINGS{Schulte98finitedomain,
author = {Christian Schulte and Gert Smolka and Jörg Würtz},
title = {Finite Domain Constraint Programming in Oz -- A Tutorial},
booktitle = {PROGRAMMING SYSTEMS LAB, GERMAN RESEARCH CENTER FOR ARTIFICIAL INTELLIGENCE (DFKI},
year = {1998},
publisher = {}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
This document introduces constraint programming in Oz. We restrict our attention to combinatorial problems that can be stated with variables ranging over finite sets of nonnegative integers. Problems in this class range from puzzles to real world applications as diverse as scheduling, ware house allocation, configuration and placement.
Citations
| 73 | A new approach to computing optimal schedules for the job-shop scheduling problem - Martin, Shmoys - 1996 |
| 37 | Industrial Scheduling - Muth, Thompson - 1963 |
| 13 | The Oz standard modules. DFKI Oz documentation series - Henz, Muller, et al. - 1994 |
| 9 | DFKI Oz user's manual. DFKI Oz documentation series, Deutsches Forschungszentrum fur Kunstliche - Mehl, Muller, et al. - 1994 |
| 9 | Time and Resource Constrained Scheduling - Nuijten - 1994 |
| 8 | Oz Scheduler: A workbench for scheduling problems - Wurtz - 1996 |
