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

Discrete Optimization

On the separation of split inequalities for non-convex quadratic integer programming

Christoph Buchheim, Emiliano Traversi

Published Nov 25, 2014• 6 citations
Publisher
DOI
10.1016/j.disopt.2014.08.002

Related papers

Gap inequalities for non-convex mixed-integer quadratic programs

Laura Galli, Konstantinos Kaparis, Adam N. Letchford

Operations Research Letters•Jul 1, 2011•14 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

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang

International series in management science/operations research/International series in operations research & management science•Jan 1, 2017•0 citations

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

Christoph Buchheim, Alberto Caprara, Andrea Lodi

Mathematical Programming•Jul 14, 2011•55 citations

Quadratic Outer Approximation for Convex Integer Programming with Box Constraints

Christoph Buchheim, Long Trieu

Lecture notes in computer science•Jan 1, 2013•12 citations

Constraint Programming for Strictly Convex Integer Quadratically-Constrained Problems

Wen-Yang Ku, J. Christopher Beck

Lecture notes in computer science•Jan 1, 2016•2 citations