Journals in DBLP

Computers & OR
1997, volume: 24, number: 11

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