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

Optimization Letters

Linear transformation based solution methods for non-convex mixed integer quadratic programs

Eric Newby, M. Montaz Ali

Published Dec 26, 2015• 1 citation
Publisher
DOI
10.1007/s11590-015-0988-y

Related papers

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

Gap inequalities for non-convex mixed-integer quadratic programs

Laura Galli, Konstantinos Kaparis, Adam N. Letchford

Operations Research Letters•Jul 1, 2011•14 citations

Transformation-Based Preprocessing for Mixed-Integer Quadratic Programs

Eric Newby, M. Montaz Ali

Journal of Optimization Theory and Applications•Sep 25, 2015•2 citations

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

Active Set Methods with Reoptimization for Convex Quadratic Integer Programming

Christoph Buchheim, Long Trieu

Lecture notes in computer science•Jan 1, 2014•5 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