On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms

DOI10.1109/TSP.2010.2071866zbMath1391.90451OpenAlexW2155654110WikidataQ57829195 ScholiaQ57829195MaRDI QIDQ4570690

Sergio Callegari, Riccardo Rovatti, Federico Bizzarri, G. Setti

Publication date: 9 July 2018

Published in: IEEE Transactions on Signal Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tsp.2010.2071866

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Quadratic programming (90C20) Modulation and demodulation in information and communication theory (94A14)

Related Items (3)

A discrete meta-control procedure for approximating solutions to binary programs ⋮ An effective branch-and-bound algorithm for convex quadratic integer programming ⋮ On linear conic relaxation of discrete quadratic programs

This page was built for publication: On the Approximate Solution of a Class of Large Discrete Quadratic Programming Problems by $\Delta\Sigma$ Modulation: The Case of Circulant Quadratic Forms