Name
Abstract | ||
|---|---|---|
•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 literature. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.ejor.2019.09.043 | European Journal of Operational Research |
Keywords | DocType | Volume |
Combinatorial optimization,Mixed-integer quadratic programming,Bilinear programming,Branch-and-cut algorithms,Intersection cuts | Journal | 282 |
Issue | ISSN | Citations |
2 | 0377-2217 | 1 |
PageRank | References | Authors |
0.35 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Matteo Fischetti | 1 | 2505 | 260.53 |
| Michele Monaci | 2 | 1049 | 60.78 |