Stix, Volker - Institut für Informationsverarbeitung und -wirtschaft … - 2001
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....