A computational comparison of branch and bound and outer approximation algorithms for 0–1 mixed integer nonlinear programs

In this paper we compare the performance of two codes for convex 0–1 mixed integer nonlinear programs on a number of test problems. The first code uses a branch and bound algorithm. The second code is a commercially available implementation of an outer approximation algorithm. The comparison demonst...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research Jg. 24; H. 8; S. 699 - 701
Hauptverfasser:	Borchers, Brian, Mitchell, John E.
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Oxford Elsevier Ltd 01.08.1997 Elsevier Science Pergamon Press Inc
Schlagworte:	Algorithms Applied sciences Approximation Comparative analysis Exact sciences and technology Flows in networks. Combinatorial problems Nonlinear programming Operational research and scientific management Operational research. Management science Portfolio theory Studies Approximation Portfolio selection Branch and bound method Combinatorial problem Mixed integer programming Non linear programming Comparative study
ISSN:	0305-0548, 1873-765X, 0305-0548
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!