scientific article; zbMATH DE number 2068059

zbMATH Open1165.90687MaRDI QIDQ4464665FDOQ4464665

Authors: Chao-Yang Gau, Linus Schrage 

Publication date: 27 May 2004

Title of this publication is not available (Why is that?)

Recommendations

• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Deterministic global optimization. Theory, methods and applications
• The global solver in the LINDO API
• \(\alpha BB\): A global optimization method for general constrained nonconvex problems
• scientific article; zbMATH DE number 1795203

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Applications of mathematical programming (90C90)

Cited In (15)

• SUSPECT: MINLP special structure detector for Pyomo
• A rigorous deterministic global optimization approach for the derivation of secondary information in digital maps
• Linear transformation based solution methods for non-convex mixed integer quadratic programs
• Deterministic global optimization. Geometric branch-and-bound methods and their applications
• Implémentation des méthodes d'optimisation : test d'arrêt optimal, contrôle et précision de la solution
• Global optimization advances in mixed-integer nonlinear programming, MINLP, and constrained derivative-free optimization, CDFO
• A framework for globally optimizing mixed-integer signomial programs
• Branch-and-sandwich: a deterministic global optimization algorithm for optimistic bilevel programming problems. I: theoretical development
• Interval computations, rigour and non-rigour in deterministic continuous global optimization
• Study of multiscale global optimization based on parameter space partition
• GLOMIQO: global mixed-integer quadratic optimizer
• ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
• A note on convex reformulation schemes for mixed integer quadratic programs
• Criteria for unconstrained global optimization
• SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework

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 Q4464665)