| 699 | -- | 701 | Brian Borchers, John E. Mitchell. A computational comparison of branch and bound and outer approximation algorithms for 0-1 mixed integer nonlinear programs |
| 703 | -- | 716 | P. Patrick Wang. Optimally scheduling ::::N:::: customer arrival times for a single-server system |
| 717 | -- | 725 | Jiafu Tang, Dingwei Wang. A nonsymmetric model for fuzzy nonlinear programming problems with penalty coefficients |
| 727 | -- | 736 | Mhand Hifi. An improvement of viswanathan and bagchi s exact algorithm for constrained two-dimensional cutting stock |
| 737 | -- | 748 | Geon Cho, Dong X. Shaw, Seong-Lyun Kim. An efficient algorithm for a capacitated subtree of a tree problem in local access telecommunication networks |
| 749 | -- | 755 | James S. Finan, William J. Hurley. The analytic hierarchy process: Does adjusting a pairwise comparison matrix to improve the consistency ratio help? |
| 757 | -- | 765 | Gerard J. Chang, Pei-Hsin Ho. The ß-assignment problem in general graphs |
| 767 | -- | 773 | Ravinder Nath, Balaji Rajagopalan, Randy Ryker. Determining the saliency of input variables in neural network classifiers |
| 775 | -- | 788 | Bahram Alidaee, Duane Rosa. Scheduling parallel machines to minimize total weighted and unweighted tardiness |
| 789 | -- | 803 | Jennifer Xie, Martin J. Fischer, Carl M. Harris. Workload and waiting time in a fixed-time loop system |