An efficient compact quadratic convex reformulation for general integer quadratic programs
type: Item
instance of: scholarly article
title: An efficient compact quadratic convex reformulation for general integer quadratic programs
zbMATH Open document ID: 1267.90092
author: Alain Billionnet
author: Sourour Elloumi
author: Amélie Lambert
published in: Computational Optimization and Applications
publication date: 2013-02-25T00:00:00Z
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6138708
zbMATH Keywords: quadratic programming
zbMATH Keywords: integer programming
zbMATH Keywords: exact convex reformulation
zbMATH Keywords: computational experiments
describes a project that uses: BARON
describes a project that uses: CSDP
describes a project that uses: CPLEX
MaRDI profile type: Publication
full work available at URL: s10589-012-9474-y
OpenAlex ID: W2039313577
cites work: Essays and Surveys in Global Optimization
cites work: Links between linear bilevel and mixed 0-1 programming problems
cites work: Extending the QCR method to general mixed-integer programs
cites work: Linear Reformulations of Integer Quadratic Programs
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: CSDP, A C library for semidefinite programming
cites work: Dynamic programming algorithms for the optimal cutting of equal rectangles
cites work: A probabilistic heuristic for a computationally difficult set covering problem
cites work: Deterministic global optimization in nonlinear optimal control problems
cites work: Perspective cuts for a class of convex 0-1 mixed integer programs
cites work: Quadratic integer programming with application to the chaotic mappings of complete multipartite graphs.
cites work: Q4198056
cites work: An algorithm for the generalized quadratic assignment problem
cites work: Aggregate line capacity design for PWB assembly systems
cites work: Global optimization. From theory to implementation.
cites work: GRASP and Path Relinking for 2-Layer Straight Line Crossing Minimization
cites work: GRASP with path-relinking for the generalized quadratic assignment problem
cites work: A polyhedral branch-and-cut approach to global optimization
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Convexification and global optimization in continuous and mixed-integer nonlinear programming. Theory, algorithms, software, and applications
DOI: 10.1007/S10589-012-9474-Y
description: scientific article; zbMATH DE number 6138708