A branch-and-cut algorithm for Mixed-Integer Bilinear Programming
Year of publication: |
2020
|
---|---|
Authors: | Fischetti, Matteo ; Monaci, Michele |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 282.2020, 2 (16.4.), p. 506-514
|
Subject: | Bilinear programming | Branch-and-cut algorithms | Combinatorial optimization | Intersection cuts | Mixed-integer quadratic programming | Theorie | Theory | Mathematische Optimierung | Mathematical programming | Ganzzahlige Optimierung | Integer programming | Algorithmus | Algorithm |
-
A rounding strategy-based algorithm for the k-clustering minimum biclique completion problem
Hifi, Mhand, (2023)
-
A massively parallel exact solution algorithm for the balanced minimum evolution problem
Catanzaro, Daniele, (2023)
-
Schöbel, Anita, (2014)
- More ...
-
Branching on nonchimerical fractionalities
Fischetti, Matteo, (2012)
-
Three ideas for the quadratic assignment problem
Fischetti, Matteo, (2012)
-
Fischetti, Matteo, (2013)
- More ...