527 | -- | 542 | M. Haimovich, A. H. G. Rinnooy Kan. Bounds and Heuristics for Capacitated Routing Problems |
543 | -- | 556 | Bruce Hajek. Extremal Splittings of Point Processes |
557 | -- | 564 | Refael Hassin, Eitan Zemel. On Shortest Paths in Graphs with Random Weights |
565 | -- | 575 | D. H. Martin, G. G. Watkins. Cores of Tangent Cones and Clarke's Tangent Cone |
576 | -- | 584 | C. N. Potts. Analysis of Heuristics for Two-Machine Flow-Shop Sequencing Subject to Release Dates |
585 | -- | 598 | A. Robert Calderbank, Edward G. Coffman Jr., Leopold Flatto. Sequencing Problems in Two-Server Systems |
599 | -- | 611 | Victor C. Pestien, William D. Sudderth. Continuous-Time Red and Black: How to Control a Diffusion to a Goal |
612 | -- | 618 | Okitsugu Fujiwara. A Note on Differentiability of Global Optimal Values |
619 | -- | 632 | Paul R. Milgrom, Robert J. Weber. Distributional Strategies for Games with Incomplete Information |
633 | -- | 641 | Graciela Chichilnisky. Von Neumann-Morgenstern Utilities and Cardinal Preferences |
642 | -- | 649 | Lars Thorlund-Petersen. Fixed Point Iterations and Global Stability in Economics |
650 | -- | 663 | M. Kojima, A. Okada, S. Shindoh. N-Person Noncooperative Games |
664 | -- | 673 | Tullio Zolezzi. Continuity of Generalized Gradients and Multipliers Under Perturbations |
674 | -- | 687 | Jacob Flachs. Generalized Cheney-Loeb-Dinkelbach-Type Algorithms |
688 | -- | 700 | Bruce P. Burrell, Michael J. Todd. The Ellipsoid Method Generates Dual Variables |
701 | -- | 708 | James Roskind, Robert E. Tarjan. A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees |
709 | -- | 715 | Colin L. Mallows, Vijayan N. Nair, Larry A. Shepp, Y. Vardi. Optimal Sequential Selection of Secretaries |