๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An example of integrating constraint programming and mathematical programming

โœ Scribed by Susanne Heipcke

Publisher
Elsevier Science
Year
1999
Tongue
English
Weight
17 KB
Volume
1
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

โœฆ Synopsis

This paper describes an integration of finite domain constraint programming techniques into mathematical programming, with an implementation of this new solution approach based on a commercial linear mixed-integer tool and a finite domain CP solver over unions of integer intervals. The combined modelling and problem solving approach has been applied to test problems of different types and dimensions. We comment on the results of these experiments.

๐Ÿ“œ SIMILAR VOLUMES

Integrating constraint logic programming
Integrating constraint logic programming and operations research techniques for the Crew Rostering Problem
โœ A. Caprara; F. Focacci; E. Lamma; P. Mello; M. Milano; P. Toth; D. Vigo ๐Ÿ“‚ Article ๐Ÿ“… 1998 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 162 KB

In this paper, we investigate the possibility of integrating Artificial Intelligence (AI) and Operations Research (OR) techniques for solving the Crew Rostering Problem (CRP). CRP calls for the optimal sequencing of a given set of duties into rosters satisfying a set of constraints. The optimality c

Constraint Logic Programming and Integer
Constraint Logic Programming and Integer Programming approaches and their collaboration in solving an assignment scheduling problem
โœ Ken Darby-Dowman; James Little; Gautam Mitra; Marco Zaffalon ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Springer US ๐ŸŒ English โš– 977 KB

Generalised Assignment Problems (GAP), traditionally solved by Integer Programming techniques, are addressed in the light of current Constraint Programming methods. A scheduling application from manufacturing, based on a modified GAP, is used to examine the performance of each technique under a vari

Convergence analysis of an augmented Lag
Convergence analysis of an augmented Lagrangian method for mathematical programs with complementarity constraints
โœ X.Q. Yang; X.X. Huang ๐Ÿ“‚ Article ๐Ÿ“… 2005 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 133 KB

In this paper, a mathematical program with complementarity constraints (MPCC) is reformulated as a nonsmooth constrained optimization problem by using the Fischer-Burmeister function. An augmented (proximal) Lagrangian method is applied to tackle the resulting constrained optimization problem. The a