Skip to main content
Log in
(current)
MIT Open Scholarship
DSpace@MIT
Search
Home
Laboratory for Information and Decision Systems (LIDS)
LIDS Technical Reports
Relaxation methods for problems with strictly convex separable costs and linear constraints
Relaxation methods for problems with strictly convex separable costs and linear constraints
Download
Name
P-1567-16296079.pdf
Size
1.09 MB
Format
Adobe PDF
Checksum
(MD5)
5b1feac8e02cea65d31ebbe6cf4321ec
Date Issued
1986
Publisher
Laboratory for Information and Decision Systems, Massachusetts Institute of Technology]
Series/Report no.
LIDS-P ; 1567
Description
Bibliography: p. 25-26.
Persistent DSpace Link
http://hdl.handle.net/1721.1/2936
