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, Alberto1 (AUTHOR) delpia@wisc.edu, Zhou, Dekun1 (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.
Be the first to leave a comment!
You must be logged in first