Computers and Operations Research

An improved interactive hybrid method for the linear multi-objective knapsack problem
pp. 991-1003(13)
Authors: Kwun I.C.; Soung H.K.

A model for the capacitated P-facility location problem in global environments
pp. 1005-1016(12)
Author: Syam S.S.

A new algorithm for the assignment problem: an alternative to the hungarian method
pp. 1017-1023(7)
Authors: Ping J.; Lee W.B.; Hongyu L.

Two-stage no-wait scheduling models with setup and removal times separated
pp. 1025-1031(7)
Authors: Gupta J.N.D.; Strusevich V.A.; Zwaneveld C.M.

A bookkeeping strategy for multiple objective linear programs
pp. 1033-1041(9)
Authors: Aurovillian A.; Hong Z.; Wiecek M.M.

Exact solution procedures for certain planning problems in flexible manufacturing systems
pp. 1043-1055(13)
Authors: Denizel M.; Erenguc S.S.

Modeling and solving several classes of arc routing problems as traveling salesman problems
pp. 1057-1061(5)
Author: Laporte G.

An aggregation procedure for simulating manufacturing flow line models
pp. 1063-1073(11)
Authors: Savory P.A.; Mackulak G.T.

A lot sizing heuristic for deteriorating items with shortages in growing and declining markets
pp. 1075-1083(9)
Authors: Hariga M.; Al-Alyan A.

Maxima of sojourn times in acyclic Jackson queueing networks
pp. 1085-1095(11)
Authors: Sungyeol K.; Serfozo R.F.

Variable neighborhood search
pp. 1097-1100(4)
Authors: Mladenovic N.; Hansen P.