Solving large MINLPs on computational grids

DOI10.1023/A:1021047328089zbMath1035.90049OpenAlexW162826962MaRDI QIDQ1863899

Jean-Pierre Goux, Sven Leyffer

Publication date: 12 March 2003

Published in: Optimization and Engineering (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1021047328089

zbMATH Keywords

metacomputingmixed integer nonlinear programmingcomputational gridparallel branch-and-bound

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)

Related Items

Redundant robust topology optimization of truss, A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach, A partial outer convexification approach to control transmission lines, Global optimization of mixed-integer nonlinear (polynomial) programming problems: The Bernstein polynomial approach, An efficient strategy for the activation of MIP relaxations in a multicore global MINLP solver, An augmented Lagrangian filter method, An improved Bernstein global optimization algorithm for MINLP problems with application in process industry, Concurrent processing of mixed‐integer non‐linear programming problems, The empirical behavior of sampling methods for stochastic programming, Challenges in Enterprise Wide Optimization for the Process Industries, Analysis of stochastic problem decomposition algorithms in computational grids

Uses Software

• BARON
• FATCOP
• AMPL
• HTCondor MW
• filterSQP
• GAMS
• minlpBB
• SBB
• MacMINLP
• SUTIL