Hostname: page-component-7dd5485656-zklqj Total loading time: 0 Render date: 2025-10-30T21:49:01.740Z Has data issue: false hasContentIssue false
  • English
  • Français

Constraint programming and maths programming

Published online by Cambridge University Press:  24 August 2001

JEAN-FRANÇOIS PUGET  and
IRVIN LUSTIG
JEAN-FRANÇOIS PUGET
Affiliation:
ILOG, 9 av. Verdun, 94250 Gentilly, France
IRVIN LUSTIG
Affiliation:
LOG, 1080 Linda Vista Ave., Mountain View, CA 94043, USA
Get access Rights & Permissions [Opens in a new window]

Abstract

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.

Information

Type
Research Article
Information
The Knowledge Engineering Review , Volume 16 , Issue 1 , March 2001 , pp. 5 - 23
Copyright
© 2001 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable