Constraint programming and maths programming
Shranjeno v:
| izdano v: | The Knowledge Engineering Review vol. 16, no. 1 (Mar 2001), p. 5-23 |
|---|---|
| Glavni avtor: | |
| Drugi avtorji: | |
| Izdano: |
Cambridge University Press
|
| Teme: | |
| Online dostop: | Citation/Abstract Full Text - PDF |
| Oznake: |
Brez oznak, prvi označite!
|
| Resumen: | Maths programming (MP) and constraint programming (CP) are two techniques that are able to solve difficult industrial optimisation problems. The purpose of this paper is to compare them from an algorithmic and a modelling point of view. Algorithmic principles of each approach are described and contrasted. Some ways of combining both techniques are also introduced. [PUBLICATION ABSTRACT] |
|---|---|
| ISSN: | 0269-8889 1469-8005 |
| Fuente: | ABI/INFORM Global |