A finite concave minimization algorithm using branch and bound and neighbor generation Harold P. BensonSerpil Sayin OriginalPaper Pages: 1 - 14
A generalization of the construction of test problems for nonconvex optimization Khosrow Moshirvaziri OriginalPaper Pages: 21 - 34
On a constructive approximation of the efficient outcomes in bicriterion vector optimization Siegfried Helbig OriginalPaper Pages: 35 - 48
On the role of continuously differentiable exact penalty functions in constrained global optimization Stefano Lucidi OriginalPaper Pages: 49 - 68
Inference of a minimum size boolean function from examples by using a new efficient branch-and-bound approach Evangelos Triantaphyllou OriginalPaper Pages: 69 - 94
Comments on a reverse convex programming algorithm S. BensaadS. E. Jacobsen OriginalPaper Pages: 95 - 96
