Scatter Search and Local NLP Solvers: A Multistart Framework for Global Optimization
INFORMS Journal on Computing
Optimization Methods & Software - GLOBAL OPTIMIZATION
Multiterm polyhedral relaxations for nonconvex, quadratically constrained quadratic programs
Optimization Methods & Software - GLOBAL OPTIMIZATION
Branching and bounds tighteningtechniques for non-convex MINLP
Optimization Methods & Software - GLOBAL OPTIMIZATION
Scheduling with compressible and stochastic release dates
Computers and Operations Research
Deterministic global optimization in ab-initio quantum chemistry
Journal of Global Optimization
GloMIQO: Global mixed-integer quadratic optimizer
Journal of Global Optimization
Hi-index | 0.00 |
The global solver in the LINDO Application Programming Interface (LINDO API) finds guaranteed global optima to nonconvex, nonlinear and integer mathematical models using the branch and bound/relax approach. We describe (a) the class of problems for which it tends to be appropriate; (b) how to access it directly via the LINDO API or via various modelling language front ends; (c) heuristics used for finding good initial solutions; (d) methods for constructing easily solved relaxations; (e) branching rules for splitting a problem into more easily solved subproblems; and (f) some illustrative computational results.