Library

eCommons

 

Minimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraints

Simple item page
dc.contributor.authorJackson, P.en_US
dc.contributor.authorRoundy, R.en_US
dc.date.accessioned2007-11-09T19:16:31Z
dc.date.available2007-11-09T19:16:31Z
dc.date.issued1988-01en_US
dc.description.abstractMinimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraintsen_US
dc.format.extent5348111 bytes
dc.format.mimetypeapplication/pdf
dc.identifier.citation767en_US
dc.identifier.urihttps://hdl.handle.net/1813/8650
dc.language.isoen_USen_US
dc.publisherCornell University Operations Research and Industrial Engineeringen_US
dc.subjectOperations Researchen_US
dc.subjectIndustrial Engineeringen_US
dc.subjecttechnical reporten_US
dc.titleMinimizing Separable Convex Objectives on Arbitrarily Directed Trees of Variable Upper Bound Constraintsen_US
dc.typetechnical reporten_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
TR000767.pdf
Size:
5.1 MB
Format:
Adobe Portable Document Format
Download

Collections

ORIE Technical Reports