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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 24; číslo 8; s. 699 - 701
Hlavní autoři:	Borchers, Brian, Mitchell, John E.
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Oxford Elsevier Ltd 01.08.1997 Elsevier Science Pergamon Press Inc
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Buďte první, kdo okomentuje tento záznam!