Optimizing constrained subtrees of trees El Houssaine AghezzafThomas L. MagnantiLaurence A. Wolsey OriginalPaper Pages: 113 - 126
A closed-form representation of mixed-integer program value functions Charles Blair OriginalPaper Pages: 127 - 136
Lower bounds for the quadratic assignment problem via triangle decompositions Stefan E. KarischFranz Rendl OriginalPaper Pages: 137 - 151
An efficient cost scaling algorithm for the assignment problem Andrew V. GoldbergRobert Kennedy OriginalPaper Pages: 153 - 177
A Gauss—Newton method for convex composite optimization J. V. BurkeM. C. Ferris OriginalPaper Pages: 179 - 194
First announcement Fifth International Symposium on Generalized Convexity Luminy-Marseille, France, June 17–21, 1996 Notice Pages: 247 - 247