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 inKnowledge engineering review Vol. 16; no. 1; pp. 5 - 23
Main Authors PUGET, JEAN-FRANÇOIS, LUSTIG, IRVIN
Format Journal Article
LanguageEnglish
Published Cambridge, UK Cambridge University Press 01.03.2001
Subjects
Algorithms
Computer science
Linear programming
Mathematical programming
Production planning
Simplex method
Variables
Online AccessGet full text

Cover

More Information
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.
Bibliography:ark:/67375/6GQ-6DRDCXZB-R
istex:F0497FEAC8CA3DC8EB7A208A7A16D5A00D568682
PII:S0269888901000042
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0269-8889
1469-8005
DOI:10.1017/S0269888901000042