Constraint programming and maths programming

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 contr...

Full description

Saved in:
Bibliographic Details
Published in:Knowledge engineering review 2001-03, Vol.16 (1), p.5-23
Main Authors: PUGET, JEAN-FRANÇOIS, LUSTIG, IRVIN
Format: Article
Language:English
Subjects:
Algorithms
Computer science
Linear programming
Mathematical programming
Production planning
Simplex method
Variables
Citations: Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0269-8889
1469-8005
DOI:10.1017/S0269888901000042