- Valery S. Gordon, Vitaly A. Strusevich:
Earliness penalties on a single machine subject to precedence constraints: SLK due date assignment. Comput. Oper. Res. 26(2): 157-177 (1999) - Faruk Güder, James L. Zydiak:
Ordering policies for multi-item inventory systems subject to multiple resource constraints. Comput. Oper. Res. 26(6): 583-597 (1999) - Gregory Z. Gutin:
Exponential neighbourhood local search for the traveling salesman problem. Comput. Oper. Res. 26(4): 313-320 (1999) - Gregory Z. Gutin, Anders Yeo:
Small diameter neighbourhood graphs for the traveling salesman problem: at most four moves from tour to tour. Comput. Oper. Res. 26(4): 321-327 (1999) - Moshe Haviv:
On censored Markov chains, best augmentations and aggregation/disaggregation procedures. Comput. Oper. Res. 26(10-11): 1125-1132 (1999) - Jishnu Hazra
, Paul J. Schweitzer, Abraham Seidmann:
Analyzing closed Kanban-controlled assembly systems by iterative aggregation-disaggregation. Comput. Oper. Res. 26(10-11): 1015-1039 (1999) - Jae-Dong Hong, Jack C. Hayya:
On integrated production-replenishment policies in single-stage manufacturing. Comput. Oper. Res. 26(5): 505-523 (1999) - Mamnoon Jamil, Alok Baveja, Rajan Batta:
The stochastic queue center problem. Comput. Oper. Res. 26(14): 1423-1436 (1999) - Kurt Jørnsten, Rainer Leisten, Sverre Storøy:
Convergence aspects of adaptive clustering in variable aggregation. Comput. Oper. Res. 26(10-11): 955-966 (1999) - Santosh N. Kabadi, Md. Fazle Baki:
Gilmore-Gomory type traveling salesman problems. Comput. Oper. Res. 26(4): 329-351 (1999) - Ayse Kavusturucu, Surendra M. Gupta:
Expansion method for the throughput analysis of open finite manufacturing/queueing networks with N-policy. Comput. Oper. Res. 26(13): 1267-1292 (1999) - Maureen Kilkenny, Jacques-François Thisse:
Economics of location: A selective survey. Comput. Oper. Res. 26(14): 1369-1394 (1999) - Soung Hie Kim, Chang Hee Han:
An interactive procedure for multi-attribute group decision making with incomplete information. Comput. Oper. Res. 26(8): 755-772 (1999) - Soung Hie Kim, Choong-Gyoo Park, Kyung Sam Park:
An application of data envelopment analysis in telephone offices evaluation with partial data. Comput. Oper. Res. 26(1): 59-72 (1999) - Alf Kimms:
A genetic algorithm for multi-level, multi-machine lot sizing and scheduling. Comput. Oper. Res. 26(8): 829-848 (1999) - Douglas M. Kline, Abraham Mehrez, Geoffrey Steinberg:
Information availability vs. solution space size in a knowledge acquisition problem. Comput. Oper. Res. 26(3): 281-292 (1999) - Manuel Laguna, Rafael Martí, Vicente Campos:
Intensification and diversification with elite tabu search solutions for the linear ordering problem. Comput. Oper. Res. 26(12): 1217-1230 (1999) - Shaw-Ping Lan, Peter Chu, Kun-Jen Chung, Wun-Jung Wan, Ricky Lo:
A simple method to locate the optimal solution of the inventory model with variable lead time. Comput. Oper. Res. 26(6): 599-605 (1999) - Won Jun Lee, Kun Chang Lee:
PROMISE: a distributed DSS approach to coordinating production and marketing decisions. Comput. Oper. Res. 26(9): 901-920 (1999) - Ho Woo Lee, S. H. Lee, Seung Hyun Yoon, Boo Yong Ahn, No Ik Park:
A recursive method for Bernoulli arrival queues and its application to partial buffer sharing in ATM. Comput. Oper. Res. 26(6): 559-581 (1999) - Ching-Fang Liaw:
A tabu search algorithm for the open shop scheduling problem. Comput. Oper. Res. 26(2): 109-126 (1999) - Ching-Fang Liaw:
A branch-and-bound algorithm for the single machine earliness and tardiness scheduling problem. Comput. Oper. Res. 26(7): 679-693 (1999) - Bertrand M. T. Lin:
The strong NP-hardness of two-stage flowshop scheduling with a common second-stage machine. Comput. Oper. Res. 26(7): 695-698 (1999) - Igor S. Litvinchev, Socorro Rangel:
Localization of the optimal solution and a posteriori bounds for aggregation. Comput. Oper. Res. 26(10-11): 967-988 (1999) - Chiun-Ming Liu:
Clustering techniques for stock location and order-picking in a distribution center. Comput. Oper. Res. 26(10-11): 989-1002 (1999) - Paul Mangiameli, David West:
An improved neural classification network for the two-group problem. Comput. Oper. Res. 26(5): 443-460 (1999) - Ruben Kirkeby Martinson, Jørgen Tind:
An interior point method in Dantzig-Wolfe decomposition. Comput. Oper. Res. 26(12): 1195-1216 (1999) - Emanuel Melachrinoudis, Frank GuangSheng Zhang:
An O(mn) Algorithm for the 1-maximin problem on a network. Comput. Oper. Res. 26(9): 849-869 (1999) - Susan K. Norman, David F. Rogers, Martin S. Levy:
Error bound comparisons for aggregation/disaggregation techniques applied to the transportation problem. Comput. Oper. Res. 26(10-11): 1003-1014 (1999) - Ralf Östermark:
Solving a nonlinear non-convex trim loss problem with a genetic hybrid algorithm. Comput. Oper. Res. 26(6): 623-635 (1999)
