View in EDS HTML Full Text PDF Full Text

A Semidefinite Programming Relaxation for the Sparse Integer Least Squares Problem.

Saved in:

Bibliographic Details
Title:	A Semidefinite Programming Relaxation for the Sparse Integer Least Squares Problem.
Authors:	Del Pia, Alberto¹ (AUTHOR) delpia@wisc.edu, Zhou, Dekun¹ (AUTHOR) dzhou44@wisc.edu
Source:	INFORMS Journal on Optimization. Winter2026, Vol. 8 Issue 1, p22-40. 19p.
Database:	Business Source Ultimate
Full text is not displayed to guests. Login for full access.

Description
ISSN:	25751484
DOI:	10.1287/ijoo.2023.0003