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

• 2004
• 
  Amir H. Abdekhodaee, Andrew Wirth, Heng-Soon Gan:
  Equal processing and equal setup time cases of scheduling parallel machines with a single server. Comput. Oper. Res. 31(11): 1867-1889 (2004)
• 
  Jawad Abrache, Benoît Bourbeau, Teodor Gabriel Crainic, Michel Gendreau:
  A new bidding framework for combinatorial e-auctions. Comput. Oper. Res. 31(8): 1177-1203 (2004)
• 
  Uwe Aickelin, Kathryn A. Dowsland:
  An indirect Genetic Algorithm for a nurse-scheduling problem. Comput. Oper. Res. 31(5): 761-778 (2004)
• 
  Georgia Alexouda:
  An evolutionary algorithm approach to the share of choices problem in the product line design. Comput. Oper. Res. 31(13): 2215-2229 (2004)
• 
  Attahiru Sule Alfa:
  Markov chain representations of discrete distributions applied to queueing models. Comput. Oper. Res. 31(14): 2365-2385 (2004)
• 
  Attahiru Sule Alfa, K. P. Sapna Isotupa:
  An M/PH/k retrial queue with finite number of sources. Comput. Oper. Res. 31(9): 1455-1464 (2004)
• 
  M. Montaz Ali, Aimo A. Törn:
  Population set-based global optimization algorithms: some modifications and numerical studies. Comput. Oper. Res. 31(10): 1703-1725 (2004)
• 
  Ali Allahverdi:
  A new heuristic for m-machine flowshop scheduling problem with bicriteria of makespan and maximum tardiness. Comput. Oper. Res. 31(2): 157-180 (2004)
• 
  Gholam R. Amin, Mehdi Toloo:
  A polynomial-time algorithm for finding epsilon in DEA models. Comput. Oper. Res. 31(5): 803-805 (2004)
• 
  Francisco Aparisi, Juan Carlos García-Díaz:
  Optimization of univariate and multivariate exponentially weighted moving-average control charts using genetic algorithms. Comput. Oper. Res. 31(9): 1437-1454 (2004)
• 
  Iván Atencia, Pilar Moreno:
  The discrete-time Geo/Geo/1 queue with negative customers and disasters. Comput. Oper. Res. 31(9): 1537-1548 (2004)
• 
  Nader Azizi, Saeed Zolfaghari:
  Adaptive temperature control for simulated annealing: a comparative study. Comput. Oper. Res. 31(14): 2439-2451 (2004)
• 
  Zaid T. Balkhi, Lakdere Benkherouf:
  On an inventory model for deteriorating items with stock dependent and time-varying demand rates. Comput. Oper. Res. 31(2): 223-240 (2004)
• 
  Enrique Ballestero, José Alberto Maldonado:
  Objective measurement of efficiency: applying single price model to rank hospital activities. Comput. Oper. Res. 31(4): 515-532 (2004)
• 
  Adil Baykasoglu, Nabil N. Z. Gindy:
  Erratum to "A simulated annealing algorithm for dynamic layout problem": [Computers & Operations Research 28 (2001) 1367-1460]. Comput. Oper. Res. 31(2): 313-315 (2004)
• 
  José Carlos Becceneri, Horacio Hideki Yanasse, Nei Yoshihiro Soma:
  A method for solving the minimization of the maximum number of open stacks problem within a cutting process. Comput. Oper. Res. 31(14): 2315-2332 (2004)
• 
  Elliot Bendoly:
  Integrated inventory pooling for firms servicing both on-line and store demand. Comput. Oper. Res. 31(9): 1465-1480 (2004)
• 
  Jean Berger, Mohamed Barkaoui:
  A parallel hybrid genetic algorithm for the vehicle routing problem with time windows. Comput. Oper. Res. 31(12): 2037-2053 (2004)
• 
  Oded Berman, Michal Cutler:
  Resource allocation during tests for optimally reliable software. Comput. Oper. Res. 31(11): 1847-1865 (2004)
• 
  Oded Berman, Richard C. Larson:
  A queueing control model for retail services having back room operations and cross-trained workers. Comput. Oper. Res. 31(2): 201-222 (2004)
• 
  Luca Bertazzi, Giuseppe Paletta, Maria Grazia Speranza:
  An improved heuristic for the period traveling salesman problem. Comput. Oper. Res. 31(8): 1215-1222 (2004)
• 
  Ümit Bilge, Furkan Kiraç, Müjde Kurtulan, Pelin Pekgün:
  A tabu search algorithm for parallel machine total tardiness problem. Comput. Oper. Res. 31(3): 397-414 (2004)
• 
  S. Ilker Birbil, Shu-Cherng Fang, Jiye Han:
  An entropic regularization approach for mathematical programs with equilibrium constraints. Comput. Oper. Res. 31(13): 2249-2262 (2004)
• 
  Motty Birman, Gur Mosheiov:
  A note on a due-date assignment on a two-machine flow-shop. Comput. Oper. Res. 31(3): 473-480 (2004)
• 
  Rafael Caballero, Mónica Hernández:
  The controlled estimation method in the multiobjective linear fractional problem. Comput. Oper. Res. 31(11): 1821-1832 (2004)
• 
  Herminia I. Calvete:
  The quickest path problem with interval lead times. Comput. Oper. Res. 31(3): 383-395 (2004)
• 
  Roberto Wolfler Calvo, Fabio de Luigi, Palle Haastrup, Vittorio Maniezzo:
  A distributed geographic information system for the daily car pooling problem. Comput. Oper. Res. 31(13): 2263-2278 (2004)
• 
  Thomas J. Candalino Jr., John E. Kobza, Sheldon H. Jacobson:
  Designing optimal aviation baggage screening strategies using simulated annealing. Comput. Oper. Res. 31(10): 1753-1767 (2004)
• 
  Dong Cao, Mingyuan Chen:
  Using penalty function and Tabu search to solve cell formation problems with fixed cell cost. Comput. Oper. Res. 31(1): 21-37 (2004)
• 
  Massimiliano Caramia, Giovanni Felici, A. Pezzoli:
  Improving search results with data mining in a thematic search engine. Comput. Oper. Res. 31(14): 2387-2404 (2004)

skipping 118 more matches