| 991 | -- | 1003 | Kwun Ik Cho, Soung Hie Kim. An improved interactive hybrid method for the linear multi-objective knapsack problem |
| 1005 | -- | 1016 | Siddhartha S. Syam. A model for the capacitated ::::p::::-facility location problem in global environments |
| 1017 | -- | 1023 | Ping Ji, W. B. Lee, HongYu Li. A new algorithm for the assignment problem: An alternative to the Hungarian method |
| 1025 | -- | 1031 | Jatinder N. D. Gupta, Vitaly A. Strusevich, C. M. Zwaneveld. Two-stage no-wait scheduling models with setup and removal times separated |
| 1033 | -- | 1041 | Alok Aurovillian, Hong Zhang, Malgorzata M. Wiecek. A bookkeeping strategy for multiple objective linear programs |
| 1043 | -- | 1055 | Meltem Denizel, S. Selçuk Erengüç. Exact solution procedures for certain planning problems in flexible manufacturing systems |
| 1057 | -- | 1061 | Gilbert Laporte. Modeling and solving several classes of arc routing problems as traveling salesman problems |
| 1063 | -- | 1073 | Paul A. Savory, Gerald T. Mackulak. An aggregation procedure for simulating manufacturing flow line models |
| 1075 | -- | 1083 | Moncer Hariga, Ali Al-Alyan. A lot sizing heuristic for deteriorating items with shortages in growing and declining markets |
| 1085 | -- | 1095 | Sungyeol Kang, Richard F. Serfozo. Maxima of sojourn times in acyclic Jackson queueing networks |
| 1097 | -- | 1100 | Nenad Mladenovic, Pierre Hansen. Variable neighborhood search |