Linear relaxations and reduced-cost based propagation of continuous variable subscripts

In hybrid solvers for combinatorial optimisation, combining Constraint (Logic) Programming (CLP) and Mixed Integer Programming (MIP), it is important to have tight connections between the two domains. We extend and generalise previous work on automatic linearisations and propagation of symbolic CLP...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Annals of operations research 2002-09, Vol.115 (1), p.15
Hauptverfasser:	Thorsteinsson, Erlendur S, Ottosson, Greger
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer programming Costs Hard disks Integer programming Linear programming Logic programming Operations research Power supply Propagation Studies Variables
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!