An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems

DOI10.1080/10556780108805827MaRDI QIDQ2774597zbMATH OpenOpenAlexFDO

Authors Ioannis G. Akrotirianakis, István Maros, Berç Rustem

Publication date 26 February 2002

Published in Optimization Methods \& Software (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/10556780108805827

zbMATH Keywords

outer approximationbranch and boundprimal-dual interior point algorithmGomory cutting planesbranch and cut algorithmconvex 0-1 mixed integer nonlinear programming

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Boolean programming (90C09)

Recommendations

• A branch-and-cut method for 0-1 mixed convex programming
• Integrating nonlinear branch-and-bound and outer approximation for convex mixed integer nonlinear programming
• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
• Algorithm for solution of convex MINLP problems
• Two linear approximation algorithms for convex mixed integer nonlinear programming

Cited in

(9)

• Lago: a (heuristic) branch and cut algorithm for nonconvex minlps
• Two linear approximation algorithms for convex mixed integer nonlinear programming
• Inversion of convection-diffusion equation with discrete sources
• A branch-and-cut method for 0-1 mixed convex programming
• A disjunctive cut strengthening technique for convex MINLP
• Algorithm for solution of convex MINLP problems
• Algorithms and Software for Convex Mixed Integer Nonlinear Programs
• Polynomial Interior Point Cutting Plane Methods
• Improving LP-Representations of Zero-One Linear Programs for Branch-and-Cut

This page was built for publication: An outer approximation based branch and cut algorithm for convex 0-1 MINLP problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2774597)