Target oriented branch & bound method for global optimization

We introduce a very simple but efficient idea for branch & bound (B&B) algorithms in global optimization (GO). As input for our generic algorithm, we need an upper bound algorithm for the GO maximization problem and a branching rule....

MoreLess

Year of publication:	2001-05-02
Authors:	Stix, Volker
Institutions:	Institut für Informationsverarbeitung und -wirtschaft <Wien>
Subject:	Prozessmanagement \| workflow management \| Branch-and-Bound-Methode \| Globale Optimierung

freely available

Full text |

More access options

Check Google Scholar

In German libraries (KVK)

I need help

More details

Extent:	195584 bytes 26 p. application/pdf
Series:	Wirtschaftsuniversität Wien - Forschungsbezogene elektronische Publikationen Working Papers on Information Processing and Information Management ; 1/2002
Type of publication:	Book / Working Paper
Language:	English
Classification:	Subject matter and research method of business administration ; Specific management methods ; Individual Working Papers, Preprints ; No country specification
Source:	USB Cologne (business full texts)

Persistent link: https://www.econbiz.de/10005841592