• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 88 matches

• 1999
• 
  Haïscam Abdallah, Raymond A. Marie, Bruno Sericola:
  Point and expected interval availability analysis with stationarity detection. Comput. Oper. Res. 26(3): 211-218 (1999)
• 
  Yash P. Aneja, Hichem Kamoun:
  Scheduling of parts and robot activities in a two machine robotic cell. Comput. Oper. Res. 26(4): 297-312 (1999)
• 
  Vinícius Amaral Armentano, Débora P. Ronconi:
  Tabu search for total tardiness minimization in flowshop scheduling problems. Comput. Oper. Res. 26(3): 219-235 (1999)
• 
  Igor Averbakh, Oded Berman:
  Algorithms for path medi-centers of a tree. Comput. Oper. Res. 26(14): 1395-1409 (1999)
• 
  Md. Fazle Baki, Santosh N. Kabadi:
  Pyramidal traveling salesman problem. Comput. Oper. Res. 26(4): 353-369 (1999)
• 
  Nagraj Balakrishnan, John J. Kanet, Sri V. Sridharan:
  Early/tardy scheduling with sequence dependent setups on uniform parallel machines. Comput. Oper. Res. 26(2): 127-141 (1999)
• 
  Gülay Barbarosoglu, Demet Özgür:
  A tabu search algorithm for the vehicle routing problem. Comput. Oper. Res. 26(3): 255-270 (1999)
• 
  Stefano Benati:
  The maximum capture problem with heterogeneous customers. Comput. Oper. Res. 26(14): 1351-1367 (1999)
• 
  Oded Berman, U. Dinesh Kumar:
  Optimization models for complex recovery block schemes. Comput. Oper. Res. 26(5): 525-544 (1999)
• 
  Liu Bin, Cao Jinhua:
  Analysis of a production-inventory system with machine breakdowns and shutdowns. Comput. Oper. Res. 26(1): 73-91 (1999)
• 
  Dirk Biskup, T. C. Edwin Cheng:
  Multiple-machine scheduling with earliness, tardiness and completion time penalties. Comput. Oper. Res. 26(1): 45-57 (1999)
• 
  Peter M. Van den Bosch, Dennis C. Dietz, Edward A. Pohl:
  Choosing the best approach to matrix exponentiation. Comput. Oper. Res. 26(9): 871-882 (1999)
• 
  Robert L. Bowerman, Paul H. Calamai, G. Brent Hall:
  The demand partitioning method for reducing aggregation errors in p-median problems. Comput. Oper. Res. 26(10-11): 1097-1111 (1999)
• 
  Noel Kweku-Muata Bryson, Anito Joseph:
  Generating consensus priority point vectors: a logarithmic goal programming approach. Comput. Oper. Res. 26(6): 637-643 (1999)
• 
  Steven E. Butt, David M. Ryan:
  An optimal solution procedure for the multiple tour maximum collection problem using column generation. Comput. Oper. Res. 26(4): 427-441 (1999)
• 
  Gin Hor Chan, Z. H. Xia, Eng Ung Choo:
  The critical cut-off value approach for dynamic lot sizing problems with time varying cost parameters. Comput. Oper. Res. 26(2): 179-188 (1999)
• 
  T. C. Edwin Cheng, Qing Ding:
  The time dependent machine makespan problem is strongly NP-complete. Comput. Oper. Res. 26(8): 749-754 (1999)
• 
  T. C. Edwin Cheng, Guoqing Wang, Chelliah Sriskandarajah:
  One-operator-two-machine flowshop scheduling with setup and dismounting times. Comput. Oper. Res. 26(7): 715-730 (1999)
• 
  Edward M. Condon, Bruce L. Golden, Edward A. Wasil:
  Predicting the success of nations at the Summer Olympics using neural networks. Comput. Oper. Res. 26(13): 1243-1265 (1999)
• 
  João Manuel Coutinho-Rodrigues, João C. N. Clímaco, John R. Current:
  An interactive bi-objective shortest path approach: searching for unsupported nondominated solutions. Comput. Oper. Res. 26(8): 789-798 (1999)
• 
  Waldemar Czuchra:
  Optimizing budget spendings for software implementation and testing. Comput. Oper. Res. 26(7): 731-747 (1999)
• 
  Richard L. Daniels, Stella Y. Hua, Scott Webster:
  Heuristics for parallel-machine flexible-resource scheduling problems with unspecified job assignment. Comput. Oper. Res. 26(2): 143-155 (1999)
• 
  Zvi Drezner, George O. Wesolowsky:
  Allocation of demand when cost is demand-dependent. Comput. Oper. Res. 26(1): 1-15 (1999)
• 
  Zvi Drezner, George O. Wesolowsky:
  Allocation of discrete demand with changing costs. Comput. Oper. Res. 26(14): 1335-1349 (1999)
• 
  Erhan Erkut, Burçin Bozkaya:
  Analysis of aggregation errors for the p-median problem. Comput. Oper. Res. 26(10-11): 1075-1096 (1999)
• 
  Andreas Fink, Stefan Voß:
  Applications of modern heuristic search methods to pattern sequencing problems. Comput. Oper. Res. 26(1): 17-34 (1999)
• 
  Gene Fliedner:
  An investigation of aggregate variable time series forecast strategies with specific subaggregate time series statistical correlation. Comput. Oper. Res. 26(10-11): 1133-1149 (1999)
• 
  Michel Gendreau, Gilbert Laporte, Christophe Musaraganyi, Éric D. Taillard:
  A tabu search heuristic for the heterogeneous fleet vehicle routing problem. Comput. Oper. Res. 26(12): 1153-1173 (1999)
• 
  Michel Gendreau, Gilbert Laporte, Daniele Vigo:
  Heuristics for the traveling salesman problem with pickup and delivery. Comput. Oper. Res. 26(7): 699-714 (1999)
• 
  Diptesh Ghosh, Nilotpal Chakravarti:
  A competitive local search heuristic for the subset sum problem. Comput. Oper. Res. 26(3): 271-279 (1999)

skipping 58 more matches