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...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	European journal of operational research Jg. 282; H. 2; S. 506 - 514
Hauptverfasser:	Fischetti, Matteo, Monaci, Michele
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 16.04.2020
Schlagworte:	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-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!