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

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	European journal of operational research Ročník 282; číslo 2; s. 506 - 514
Hlavní autori:	Fischetti, Matteo, Monaci, Michele
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.04.2020
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!