| 573 | -- | 596 | John M. Danskin. On the Cookie-Cutter Game: Search and Evasion on a Disc |
| 597 | -- | 625 | Jean-Paul Penot, Michel Volle. On Quasi-Convex Duality |
| 626 | -- | 639 | Jirí V. Outrata. On Generalized Gradients in Optimization Problems with Set-Valued Constraints |
| 640 | -- | 661 | Andrew B. Philpott. Continuous-Time Flows in Networks |
| 662 | -- | 675 | Masakazu Kojima, Shinji Mizuno, Toshihito Noma. Limiting Behavior of Trajectories Generated by a Continuation Method for Monotone Complementarity Problems |
| 676 | -- | 713 | M. H. A. Davis, A. R. Norman. Portfolio Selection with Transaction Costs |
| 714 | -- | 723 | Dov Monderer. A Milnor Condition for Nonatomic Lipschitz Games and Its Applications |
| 724 | -- | 735 | Dave Furth. Solving Bargaining Games by Differential Equations |
| 736 | -- | 748 | Clyde L. Monma, Alexander Schrijver, Michael J. Todd, Victor K.-W. Wei. Convex Resource Allocation Problems on Directed Acyclic Graphs: Duality, Complexity, Special Cases, and Extensions |
| 749 | -- | 770 | J. Michael Steele. Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space |
| 771 | -- | 793 | F. P. Kelly. Routing and Capacity Allocation in Networks with Trunk Reservation |