Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

European Journal of Operational Research

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

Matteo Fischetti, Michele Monaci

Published Sep 26, 2019• 38 citations
Publisher
DOI
10.1016/j.ejor.2019.09.043

Related papers

A Branch and Bound algorithm for general mixed-integer quadratic programs based on quadratic convex relaxation

Alain Billionnet, Sourour Elloumi, Amélie Lambert

Journal of Combinatorial Optimization•Nov 13, 2012•7 citations

An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Lecture notes in computer science•Jan 1, 2010•10 citations

An effective branch-and-bound algorithm for convex quadratic integer programming

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Mathematical Programming•Jul 14, 2011•57 citations

An approximation algorithm for indefinite mixed integer quadratic programming

Alberto Del Pia

arXiv:2211.16442•Mathematical Programming•Dec 2, 2022•8 citations

Learning to select cutting planes in mixed integer linear programming solving

Xuefeng Zhang, Liangyu Chen, Zhengfeng Yang +1 more

Expert Systems with Applications•Oct 4, 2025•5 citations

Learning to Select Cutting Planes in Mixed Integer Linear Programming Solving

Xuefeng Zhang, Liang-Yü Chen, Zhengfeng Yang +1 more

arXiv:2410.03112•Jan 1, 2024•2 citations