Theoretical and computational study of several linearisation techniques for binary quadratic problems
Sign Up to like & getrecommendations! Published in 2019 at "Annals of Operations Research"
DOI: 10.1007/s10479-018-3118-2
Abstract: We perform a theoretical and computational study of the classical linearisation techniques (LT) and we propose a new LT for binary quadratic problems (BQPs). We discuss the relations between the linear programming (LP) relaxations of… read more here.
Keywords: quadratic problems; theoretical computational; binary quadratic; computational study ... See more keywords
Nonconvex min–max fractional quadratic problems under quadratic constraints: copositive relaxations
Sign Up to like & getrecommendations! Published in 2019 at "Journal of Global Optimization"
DOI: 10.1007/s10898-019-00780-3
Abstract: In this paper we address a min–max problem of fractional quadratic (not necessarily convex) over linear functions on a feasible set described by linear and (not necessarily convex) quadratic functions. We propose a conic reformulation… read more here.
Keywords: fractional quadratic; quadratic problems; max fractional; min max ... See more keywords