scientific article; zbMATH DE number 553775

DOI<455::AID-NAV3220410310>3.0.CO;2-Q 10.1002/1520-6750(199404)41:3<455::AID-NAV3220410310>3.0.CO;2-QzbMath0799.90097MaRDI QIDQ4287999

Kurt M. Bretthauer

Publication date: 19 April 1994

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

branch-and-boundnonconvex problempenaltyTuy cutting plane

Mathematics Subject Classification ID

Nonconvex programming, global optimization (90C26)

Related Items (2)

Nonconvex optimization over a polytope using generalized capacity improvement ⋮ Unnamed Item

Cites Work

• A collection of test problems for constrained global optimization algorithms
• Unnamed Item

This page was built for publication: