• 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 125 matches

• 2002
• 
  Amir H. Abdekhodaee, Andrew Wirth:
  Scheduling parallel machines with a single server: some solvable cases and heuristics. Comput. Oper. Res. 29(3): 295-315 (2002)
• 
  Mohamed A. Ahmed, Talal M. Alkhamis:
  Simulation-based optimization using simulated annealing with ranking and selection. Comput. Oper. Res. 29(4): 387-402 (2002)
• 
  M. Selim Akturk, Siraceddin Onen:
  Dynamic lot sizing and tool management in automated manufacturing systems. Comput. Oper. Res. 29(8): 1059-1079 (2002)
• 
  M. Montaz Ali, Aimo A. Törn, Sami Viitanen:
  A direct search variant of the simulated annealing algorithm for optimization involving continuous variables. Comput. Oper. Res. 29(1): 87-102 (2002)
• 
  Ali Allahverdi, Fawaz S. Al-Anzi:
  Using two-machine flowshop with maximum lateness objective to model multimedia data objects scheduling problem for WWW applications. Comput. Oper. Res. 29(8): 971-994 (2002)
• 
  Ramón Alvarez-Valdés, Antonio Parajón, José Manuel Tamarit:
  A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems. Comput. Oper. Res. 29(7): 925-947 (2002)
• 
  Francisco J. Arcelus, T. P. M. Pakkala, Gopalan Srinivasan:
  A myopic policy for the gradual obsolescence problem with price-dependent demand. Comput. Oper. Res. 29(9): 1115-1127 (2002)
• 
  Roberto Baldacci, Eleni Hadjiconstantinou, Vittorio Maniezzo, Aristide Mingozzi:
  A new method for solving capacitated location problems based on a set partitioning approach. Comput. Oper. Res. 29(4): 365-386 (2002)
• 
  Oded Berman, Dmitry Krass:
  The generalized maximal covering location problem. Comput. Oper. Res. 29(6): 563-581 (2002)
• 
  Indranil Bose, Raktim Pal:
  Average waiting time of customers in a priority M/D/k queue with finite buffers. Comput. Oper. Res. 29(4): 327-339 (2002)
• 
  Kurt M. Bretthauer, Bala Shetty:
  A pegging algorithm for the nonlinear resource allocation problem. Comput. Oper. Res. 29(5): 505-527 (2002)
• 
  Jack Brimberg, George O. Wesolowsky:
  Locating facilities by minimax relative to closest points of demand areas. Comput. Oper. Res. 29(6): 625-636 (2002)
• 
  Luce Brotcorne, Gilbert Laporte, Frédéric Semet:
  Fast heuristics for large scale covering-location problems. Comput. Oper. Res. 29(6): 651-665 (2002)
• 
  Giuseppe Bruno, Michel Gendreau, Gilbert Laporte:
  A heuristic for the location of a rapid transit line. Comput. Oper. Res. 29(1): 1-12 (2002)
• 
  Rafael Caballero, Trinidad Gómez, Mariano Luque, Francisca Miguel, Francisco Ruiz:
  Hierarchical generation of Pareto optimal solutions in large-scale multiobjective systems. Comput. Oper. Res. 29(11): 1537-1558 (2002)
• 
  I-Ming Chao:
  A tabu search method for the truck and trailer routing problem. Comput. Oper. Res. 29(1): 33-51 (2002)
• 
  Yi-Kuang Chen, Shih-Wei Lin, Shuo-Yan Chou:
  An efficient two-staged approach for generating block layouts. Comput. Oper. Res. 29(5): 489-504 (2002)
• 
  Zhi-Long Chen, Shanling Li, Devanath Tirupati:
  A scenario-based stochastic programming approach for technology and capacity planning. Comput. Oper. Res. 29(7): 781-806 (2002)
• 
  T. C. Edwin Cheng, Zhi-Long Chen, Natalia V. Shakhlevich:
  Common due date assignment and scheduling with ready times. Comput. Oper. Res. 29(14): 1957-1967 (2002)
• 
  T. C. Edwin Cheng, Mikhail Y. Kovalyov:
  An unconstrained optimization problem is NP-hard given an oracle representation of its objective function: a technical note. Comput. Oper. Res. 29(14): 2087-2091 (2002)
• 
  Sung A. Cho, Chae-Bogk Kim, Dong Hoon Lee:
  Single machine MAD/T_max problem with a common due date. Comput. Oper. Res. 29(8): 1099-1113 (2002)
• 
  Gautam Choudhury:
  A batch arrival queue with a vacation time under single vacation policy. Comput. Oper. Res. 29(14): 1941-1955 (2002)
• 
  Peter Chu, Patrick S. Chen:
  A note on inventory replenishment policies for deteriorating items in an exponentially declining market. Comput. Oper. Res. 29(13): 1827-1842 (2002)
• 
  Richard L. Church:
  Geographical information systems and location science. Comput. Oper. Res. 29(6): 541-562 (2002)
• 
  Jeffery K. Cochran, Theodore P. Lewis:
  Computing small-fleet aircraft availabilities including redundancy and spares. Comput. Oper. Res. 29(5): 529-540 (2002)
• 
  B. W. Conolly, P. R. Parthasarathy, N. Selvaraju:
  Double-ended queues with impatience. Comput. Oper. Res. 29(14): 2053-2072 (2002)
• 
  Angel Corberán, Rafael Martí, Eulalia Martínez, David Soler:
  The Rural Postman Problem on mixed graphs with turn penalties. Comput. Oper. Res. 29(7): 887-903 (2002)
• 
  Norman D. Curet, Jason DeVinney, Matthew E. Gaston:
  An efficient network flow code for finding all minimum cost s-t cutsets. Comput. Oper. Res. 29(3): 205-219 (2002)
• 
  Bruce Curry, Peter H. Morgan, Mick Silver:
  Neural networks and non-linear statistical methods: an application to the modelling of price-quality relationships. Comput. Oper. Res. 29(8): 951-969 (2002)
• 
  Steven J. D'Amico, Shoou-Jiun Wang, Rajan Batta, Christopher M. Rump:
  A simulated annealing approach to police district design. Comput. Oper. Res. 29(6): 667-684 (2002)

skipping 95 more matches