scientific article; zbMATH DE number 1054664

MaRDI QIDQ4352204zbMATH OpenFDO

Authors V. Visweswaran, Christodoulos A. Floudas

Publication date 1 December 1997

zbMATH Keywords

branch-and-boundnonconvex optimizationprimal and relaxed dual problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Mixed integer programming (90C11) Nonconvex programming, global optimization (90C26) Nonlinear programming (90C30)

Recommendations

• scientific article; zbMATH DE number 1054665
• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• New bounding schemes and algorithmic options for the Branch-and-Sandwich algorithm
• scientific article; zbMATH DE number 994413
• A new node selection strategy in the branch-and-bound procedure
• A novel branching strategy for parameterized graph modification problems
• A remark on the GOP algorithm for global optimization
• Branch-and-bound algorithms: a survey of recent advances in searching, branching, and pruning

Cited in

(8)

• New properties and computational improvement of the GOP algorithm for problems with quadratic objective functions and constraints
• Primal-relaxed dual global optimization approach
• Complexity analysis and algorithm design of pooling problem
• Rigorous convex underestimators for general twice-differentiable problems
• Generalized primal-relaxed dual approach for global optimization
• scientific article; zbMATH DE number 1054665 (Why is no real title available?)
• New multi-commodity flow formulations for the pooling problem
• An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4352204)