Goux, J.-P.; Leyffer, S. Solving large MINLPs on computational grids. (English) Zbl 1035.90049 Optim. Eng. 3, No. 3, 327-346 (2002). Summary: We consider the solution of Mixed Integer Nonlinear Programming (MINLP) problems by a parallel implementation of nonlinear branch-and-bound on a computational grid or meta-computer. Computational experience on a set of large MINLPs is reported which indicates that this approach is efficient for the solution of these problems. Cited in 11 Documents MSC: 90C11 Mixed integer programming 90-04 Software, source code, etc. for problems pertaining to operations research and mathematical programming 90C57 Polyhedral combinatorics, branch-and-bound, branch-and-cut Keywords:mixed integer nonlinear programming; parallel branch-and-bound; computational grid; metacomputing Software:MacMINLP; SBB; GAMS; filterSQP; HTCondor MW; AMPL; minlpBB; BARON; SUTIL; FATCOP PDFBibTeX XMLCite \textit{J. P. Goux} and \textit{S. Leyffer}, Optim. Eng. 3, No. 3, 327--346 (2002; Zbl 1035.90049) Full Text: DOI