Publication:4464655
From MaRDI portal
zbMath1165.49306MaRDI QIDQ4464655
Claire S. Adjiman, Ioannis Papamichail
Publication date: 27 May 2004
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
Related Items
Improved relaxations for the parametric solutions of ODEs using differential inequalities, Study of multiscale global optimization based on parameter space partition, Solving planning and design problems in the process industry using mixed integer and global optimization, A review of recent advances in global optimization, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Direct methods with maximal lower bound for mixed-integer optimal control problems, On metaheuristics for solving the parameter estimation problem in dynamic systems: a comparative study, Dynamic Global Optimization Methods for Determining Guaranteed Solutions in Chemical Engineering