A decomposition algorithm for shortest paths in a network with many strongly connected components P. Brucker OriginalPaper Pages: 177 - 180
Parameter-free convex equivalent and dual programs of fractional programming problems S. Schaible OriginalPaper Pages: 187 - 196
Efficient and optimal portfolios by homogeneous programming P. van MoesekeB. von Hohenbalken OriginalPaper Pages: 205 - 214
An iterative method for approximating average cost optimal (s,S) inventory policies H. C. Tijms OriginalPaper Pages: 215 - 223