A branch and bound algorithm with constraint partitioning for integer goal programming problems

Using constraint partitioning and variable elimination, the authors have recently developed an efficient algorithm for solving linear goal programming problems. However, many goal programs require some or all of the decision variables to be integer valued. This paper shows how the new partitioning a...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research 1980-01, Vol.4 (6), p.421-425
Hauptverfasser:	Arthur, Jeffrey L., Ravindran, A.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Decision making Goal programming Integer programming Partitions
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!