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

DOI10.1080/10556780108805827zbMath1003.90027OpenAlexW2013372393MaRDI QIDQ2774597

István Maros, Ioannis G. Akrotirianakis, Berc Rustem

Publication date: 26 February 2002

Published in: Optimization Methods and Software (Search for Journal in Brave)

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

zbMATH Keywords

branch and boundouter approximationprimal-dual interior point algorithmbranch and cut algorithmGomory cutting planesconvex 0-1 mixed integer nonlinear programming

Mathematics Subject Classification ID

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

Related Items (3)

Inversion of convection-diffusion equation with discrete sources ⋮ Algorithms and Software for Convex Mixed Integer Nonlinear Programs ⋮ Polynomial Interior Point Cutting Plane Methods

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