On Finitely Terminating Branch-and-Bound Algorithms for Some Global Optimization Problems
From MaRDI portal
Publication:4509750
DOI10.1137/S105262349935178XzbMath0994.65068MaRDI QIDQ4509750
Hanif D. Sherali, Faiz A. Al-Khayyal
Publication date: 19 October 2000
Published in: SIAM Journal on Optimization (Search for Journal in Brave)
Numerical mathematical programming methods (65K05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonconvex programming, global optimization (90C26)
Related Items
The cost of not knowing enough: mixed-integer optimization with implicit Lipschitz nonlinearities, A storm of feasibility pumps for nonconvex MINLP, On interval-subgradient and no-good cuts, Solving a class of low rank d.c. programs via a branch and bound approach: a computational experience, A successive linear relaxation method for MINLPs with multivariate Lipschitz continuous nonlinearities, Comparison of Simulated Annealing, Interval Partitioning and Hybrid Algorithms in Constrained Global Optimization, Domain reduction techniques for global NLP and MINLP optimization, Global minimization using an augmented Lagrangian method with variable lower-level constraints, Reformulations in mathematical programming: automatic symmetry detection and exploitation, Outer approximation algorithms for canonical DC problems, A branch-and-cut algorithm for mixed-integer bilinear programming, A branch and reduce approach for solving a class of low rank d.c. programs, Augmented Lagrangians with possible infeasibility and finite termination for global nonlinear programming, Bidimensional packing by bilinear programming, Iteratively adaptive regularization in inverse modeling with Bayesian outlook – application on geophysical data, A decomposition method for MINLPs with Lipschitz continuous nonlinearities
