A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
type: Item
instance of: scholarly article
title: A note on representations of linear inequalities in non-convex mixed-integer quadratic programs
zbMATH Open document ID: 1409.90129
author: Adam N. Letchford
author: Daniel J. Grainger
published in: Operations Research Letters
publication date: 2019-02-22T00:00:00Z
full work available at URL: miqp note.pdf
Mathematics Subject Classification ID: 90C20
Mathematics Subject Classification ID: 90C11
Mathematics Subject Classification ID: 90C26
zbMATH DE Number: 7027819
zbMATH Keywords: mixed-integer nonlinear programming
zbMATH Keywords: global optimisation
zbMATH Keywords: semidefinite programming
describes a project that uses: Knapsack
MaRDI profile type: Publication
OpenAlex ID: W2765372555
cites work: A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
cites work: Semidefinite programming versus the reformulation-linearization technique for nonconvex quadratically constrained quadratic programming
cites work: Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
cites work: Pseudo-Boolean optimization
cites work: Unbounded convex sets for non-convex mixed-integer quadratic programming
cites work: A finite branch-and-bound algorithm for nonconvex quadratic programming via semidefinite relaxations
cites work: Constrained 0-1 quadratic programming: basic approaches and extensions
cites work: Exact Solution of the Quadratic Knapsack Problem
cites work: Geometry of cuts and metrics
cites work: Q3270229
cites work: Semidefinite programming relaxation for nonconvex quadratic programs
cites work: Gap inequalities for non-convex mixed-integer quadratic programs
cites work: A Spectral Bundle Method for Semidefinite Programming
cites work: Solving quadratic (0,1)-problems by semidefinite programs and cutting planes
cites work: A semidefinite programming approach to the quadratic knapsack problem
cites work: Q4821303
cites work: Cones of Matrices and Set-Functions and 0–1 Optimization
cites work: The Boolean quadratic polytope: Some characteristics, facets and relatives
cites work: A recipe for semidefinite relaxation for \((0,1)\)-quadratic programming
cites work: A Hierarchy of Relaxations between the Continuous and Convex Hull Representations for Zero-One Programming Problems
cites work: A reformulation-convexification approach for solving nonconvex quadratic programming problems
DOI: 10.1016/J.ORL.2017.10.007
description: scientific article; zbMATH DE number 7027819