A branch-and-cut algorithm for Mixed-Integer Bilinear Programming

•We consider the Mixed-Integer Bilinear Programming problem.•We design an exact branch-and-cut algorithm, based on a new branching rule.•A new family of intersection cuts derived from bilinear disjunctions is proposed.•We analyze the algorithm’s performance on a large instance set from the literatur...

Full description

Bibliographic Details

Published in:	European journal of operational research Vol. 282; no. 2; pp. 506 - 514
Main Authors:	Fischetti, Matteo, Monaci, Michele
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.04.2020
Subjects:	Bilinear programming Branch-and-cut algorithms Combinatorial optimization Intersection cuts Mixed-integer quadratic programming Branch-and-cut algorithms Intersection cuts Bilinear programming Combinatorial optimization Mixed-integer quadratic programming
ISSN:	0377-2217, 1872-6860
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!