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

A branch and cut algorithm is developed for solving convex 0-1 Mixed Integer Nonlinear Programming (MINLP) problems. The algorithm integrates Branch and Bound, Outer Approximation and Gomory Cutting Planes. Only the initial Mixed Integer Linear Programming (MILP) master problem is considered. At int...

Full description

Saved in:

Bibliographic Details
Published in:	Optimization methods & software Vol. 16; no. 1-4; pp. 21 - 47
Main Authors:	Rustem, Berc, Akrotirianakis, Ioannis, Maros, Istvan
Format:	Journal Article
Language:	English
Published:	Gordon and Breach Science Publishers 01.01.2001
Subjects:	Branch and Cut Gomory Cuts Integer Programming Nonlinear Programming Outer Approximation
ISSN:	1055-6788, 1029-4937
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!