Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
From MaRDI portal
Publication:1881050
DOI10.1007/s10107-003-0467-6zbMath1062.90041MaRDI QIDQ1881050
Nikolaos V. Sahinidis, Mohit Tawarmalani
Publication date: 27 September 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0467-6
Related Items
A revised Taha's algorithm for polynomial 0-1 programming, Global optimization of explicit strong-stability-preserving Runge-Kutta methods, A global optimization method, QBB, for twice-differentiable nonconvex optimization problem, An exact reformulation algorithm for large nonconvex nLPs involving bilinear terms, A lagrangean based branch-and-cut algorithm for global optimization of nonconvex mixed-integer nonlinear programs with decomposable structures, Lago: a (heuristic) branch and cut algorithm for nonconvex minlps, Computing exact solution to nonlinear integer programming: convergent Lagrangian and objective level cut method, An algorithmic framework for convex mixed integer nonlinear programs, Efficient interval partitioning for constrained global optimization, Parametric mixed-integer 0-1 linear programming: The general case for a single parameter, An exact solution method for reliability optimization in complex systems, A polyhedral branch-and-cut approach to global optimization, A simplicial branch-and-bound algorithm for solving quadratically constrained quadratic programs, A comparison of complete global optimization solvers, Optimization of a complex flexible multibody systems with composite materials, Efficient interval partitioning-local search collaboration for constraint satisfaction, Global optimization in stabilizing controller design, Robust optimization of contaminant sensor placement for community water systems, A local relaxation approach for the siting of electrical substations, An optimization method for solving mixed discrete-continuous programming problems, Reliability redundancy allocation: an improved realization for nonconvex nonlinear programming problems, Accelerating branch-and-bound through a modeling language construct for relaxation-specific constraints, Disjunctive Cuts for Non-convex Mixed Integer Quadratically Constrained Programs
Uses Software
