Minimizing Separable Convex Objectives on Arbitrarily...

Mathematics of Operations Research 1991 / 08 Vol. 16; Iss. 3

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

Peter L. Jackson and Robin O. Roundy
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
16
Language:
english
Journal:
Mathematics of Operations Research
DOI:
10.2307/3690036
Date:
August, 1991
File:
PDF, 1000 KB
english, 1991
Conversion to is in progress
Conversion to is failed