Lago: a (heuristic) branch and cut algorithm for nonconvex minlps

DOI10.1007/s10100-007-0051-xzbMath1152.90665OpenAlexW2091879840MaRDI QIDQ940828

Stefan Vigerske, Ivo Nowak

Publication date: 3 September 2008

Published in: CEJOR. Central European Journal of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10100-007-0051-x

zbMATH Keywords

global optimizationbranch and boundouter approximationbranch and cutmixed-integer nonlinear programming

Mathematics Subject Classification ID

Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Nonlinear programming (90C30)

Related Items (8)

Mixed integer nonlinear programming tools: an updated practical overview ⋮ SUSPECT: MINLP special structure detector for Pyomo ⋮ Generalized Benders Decomposition for one Class of MINLPs with Vector Conic Constraint ⋮ Deterministic global optimization of steam cycles using the IAPWS-IF97 model ⋮ SCIP: global optimization of mixed-integer nonlinear programs in a branch-and-cut framework ⋮ Three enhancements for optimization-based bound tightening ⋮ Convex mixed integer nonlinear programming problems and an outer approximation algorithm ⋮ Mixed integer nonlinear programming tools: a practical overview

Uses Software

• BARON
• LaGO
• CPLEX
• Ipopt
• GAMS
• MINLPLib
• alphaBB

Cites Work

• Unnamed Item
• A new semidefinite programming bound for indefinite quadratic forms over a simplex
• Solving mixed integer nonlinear programs by outer approximation
• Lagrangian decomposition of block-separable mixed-integer all-quadratic programs
• Rigorous convex underestimators for general twice-differentiable problems
• Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
• Global optimization of mixed-integer nonlinear programs: a theoretical and computational study
• Relaxation and decomposition methods for mixed integer nonlinear programming.
• On the implementation of an interior-point filter line-search algorithm for large-scale nonlinear programming
• A new class of improved convex underestimators for twice continuously differentiable constrained NLPs
• Convex underestimation of twice continuously differentiable functions by piecewise quadratic perturbation: spline \(\alpha\)BB underestimators
• MINLPLib—A Collection of Test Models for Mixed-Integer Nonlinear Programming
• Aggregation and Mixed Integer Rounding to Solve MIPs
• An outer-approximation algorithm for a class of mixed-integer nonlinear programs
• Complete search in continuous global optimization and constraint satisfaction
• Global Optimization and Constraint Satisfaction

This page was built for publication: Lago: a (heuristic) branch and cut algorithm for nonconvex minlps