1 | -- | 7 | Tamon Stephen, Levent Tunçel. On a Representation of the Matching Polytope Via Semidefinite Liftings |
8 | -- | 34 | Peter P. Wakker, Horst Zank. State Dependent Expected Utility for Savage's State Space |
35 | -- | 49 | Dimitris Alevras. Small Min-Cut Polyhedra |
50 | -- | 71 | Roland W. Freund, Florian Jarre, Shinji Mizuno. Convergence of a Class of Inexact Interior-Point Algorithms for Linear Programs |
95 | -- | 105 | Kazuo Murota, Akiyoshi Shioura. M-Convex Function on Generalized Polymatroid |
106 | -- | 129 | Julie A. Ward. Minimum-Aggregate-Concave-Cost Multicommodity Flows in Strong-Series-Parallel Networks |
130 | -- | 148 | Lisa Fleischer, Éva Tardos. Separating Maximally Violated Comb Inequalities in Planar Graphs |
149 | -- | 175 | Masakazu Muramatsu, Robert J. Vanderbei. Primal-Dual Affine-Scaling Algorithms Fail for Semidefinite Programming |
176 | -- | 192 | Kurt M. Anstreicher, Jun Ji, Florian A. Potra, Yinyu Ye. Probabilistic Analysis of an Infeasible-Interior-Point Algorithm for Linear Programming |
193 | -- | 203 | Kurt M. Anstreicher. Ellipsoidal Approximations of Convex Sets Based on the Volumetric Barrier |
204 | -- | 218 | Ehud Lehrer, Leeat Yariv. Repeated Games with Incomplete Information on One Side: The Case of Different Discount Factors |
219 | -- | 236 | Stephen C. Billups, Michael C. Ferris. Solutions to Affine Generalized Equations Using Proximal Mappings |
237 | -- | 254 | Krzysztof C. Kiwiel, Torbjörn Larsson, Per Olov Lindberg. The Efficiency of Ballstep Subgradient Level Methods for Convex Optimization |
255 | -- | 261 | M. Seetharama Gowda, Roman Sznajder. Weak Univalence and Connectedness of Inverse Images of Continuous Functions |
262 | -- | 272 | Rainer E. Burkard, Vladimir G. Deineko, Gerhard J. Woeginger. Erratum: The Travelling Salesman and the PQ-Tree |